JOURNAL ARTICLE
More algorithms for all-pairs shortest paths in weighted graphs
Abstract
In the first part of the paper, we reexamine the all-pairsshortest paths (APSP) problem and present a newalgorithm with running time approaching O(n3/log2n), which improves all known algorithms for general real-weighted dense graphs andis perhaps close to the best result possible without using fast matrix multiplication, modulo a few log log n factors.
Keywords:
Modulo Combinatorics Multiplication (music) Algorithm Matrix multiplication Computer science Matrix (chemical analysis) Mathematics Binary logarithm Discrete mathematics Time complexity
Metrics
164
Cited By
22.10
FWCI (Field Weighted Citation Impact)
50
Refs
1.00
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Graph Labeling and Dimension Problems
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
Journal: SIAM Journal on Computing Year: 2010 Vol: 39 (5)Pages: 2075-2089
JOURNAL ARTICLE
All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms
Year: 2002 Pages: 310-319
BOOK-CHAPTER
All Pairs Shortest Paths in Sparse Graphs
Encyclopedia of Algorithms Year: 2008 Pages: 28-31
BOOK-CHAPTER
All Pairs Shortest Paths in Sparse Graphs
Encyclopedia of Algorithms Year: 2014 Pages: 1-5
BOOK-CHAPTER
All Pairs Shortest Paths in Sparse Graphs
Encyclopedia of Algorithms Year: 2016 Pages: 52-55