Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
On the all-pairs-shortest-path problem in unweighted undirected graphs
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
All pairs shortest distances for graphs with small integer length edges
Information and Computation
Data Structures and Algorithms
Data Structures and Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Undirected single source shortest paths in linear time
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
All Pairs Shortest Paths in weighted directed graphs ? exact and almost exact algorithms
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An O(n3log logn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
O(1) query time algorithm for all pairs shortest distances on permutation graphs
Discrete Applied Mathematics
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Information Processing Letters
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Efficient algorithms for the 2-center problems
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
| Hi-index | 0.89 |
We present an improved algorithm for all pairs shortest paths. For a graph of n vertices our algorithm runs in O(n3(log log n/log n)5/7) time. This improves the best previous result which runs in O(n3(log log n/log n)1/2) time.