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
Improved parallel integer sorting without concurrent writing
Information and Computation
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
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
Improved algorithm for all pairs shortest paths
Information Processing Letters
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
SIAM Journal on Computing
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem
Information Processing Letters
Shortest paths in matrix multiplication time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
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
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
All-pairs bottleneck paths for general graphs in truly sub-cubic time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Information Processing Letters
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A sub-cubic time algorithm for the k-maximum subarray problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We present an O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n3/logn) time.