Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
A new upper bound on the complexity of the all pairs shortest path problem
Information Processing Letters
Clique partitions, graph compression and speeding-up algorithms
Journal of Computer and System Sciences
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 paths for graphs with small integer length edges
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
On the exponent of the all pairs shortest path problem
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
All pairs shortest distances for graphs with small integer length edges
Information and Computation
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
SIAM Journal on Computing
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
All-Pairs Almost Shortest Paths
SIAM Journal on Computing
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Improved algorithm for all pairs shortest paths
Information Processing Letters
Journal of Computer and System Sciences - Special issue: STOC 2003
A Shortest Path Algorithm for Real-Weighted Undirected 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
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the K-simple shortest paths problem in weighted directed graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs
Proceedings of the fifth international workshop on Foundations of mobile computing
Fast computation of empirically tight bounds for the diameter of massive graphs
Journal of Experimental Algorithmics (JEA)
Efficient algorithms for clique problems
Information Processing Letters
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs
Computational Geometry: Theory and Applications
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Compact navigation and distance oracles for graphs with small treewidth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Note: A note on planar graphs with large width parameters and small grid-minors
Discrete Applied Mathematics
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
Optimal distributed all pairs shortest paths and applications
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Faster approximation of distances in graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Sharing information in all pairs shortest path algorithms
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Sharing information in all pairs shortest path algorithms
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
| Hi-index | 0.00 |
We revisit the all-pairs-shortest-paths problem for an unweighted undirected graph with n vertices and m edges. We present new algorithms with the following running times:[EQUATION]These represent the best time bounds known for the problem for all m ≪ n1.376. We also obtain a similar type of result for the diameter problem for unweighted directed graphs.