Sharing information for the all pairs shortest path problem
نویسندگان
چکیده
منابع مشابه
Sharing Information in All Pairs Shortest Path Algorithms
We show two improvements on time complexities of the all pairs shortest path (APSP) problem for directed graphs that satisfy certain properties. The idea for speed-up is information sharing by n single source shortest path (SSSP) problems that are solved for APSP. We consider two parameters, in addition to the numbers of vertices, n, and edges, m. First we improve the time complexity of O(mn+n ...
متن کاملOn the Exponent of the All Pairs Shortest Path Problem
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for the very special case of directed graphs with uniform edge lengths. In this paper we give an algor...
متن کاملAll Colors Shortest Path Problem
All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem is computationally similar to general...
متن کاملOn the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
The Shoshan-Zwick algorithm solves the all pairs shortest paths problem in undirected graphs with integer edge costs in the range {1, 2, . . . ,M}. It runs in Õ(M · n) time, where n is the number of vertices, M is the largest integer edge cost, and ω < 2.3727 is the exponent of matrix multiplication. It is the fastest known algorithm for this problem. This paper points out the erroneous behavio...
متن کاملScalability of Parallel Algorithms for the All-Pairs Shortest Path Problem: A Summary of Results
This paper uses the isoeeciency metric to analyze the scalability of several parallel algorithms for nding shortest paths between all pairs of nodes in a densely connected graph. Parallel algorithms analyzed in this paper have either been previously presented elsewhere or are small variations of them. Scalability is analyzed with respect to mesh, hypercube and shared-memory architectures. We de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.09.006