Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
DOI10.1007/978-3-540-77050-3_27zbMATH Open1135.90424OpenAlexW1606169264MaRDI QIDQ5458845FDOQ5458845
Authors: Telikepalli Kavitha 
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://eprints.iisc.ac.in/41497/1/10.1.1.100.8606.pdf
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Approximate distance oracles
- All-Pairs Almost Shortest Paths
- Computing almost shortest paths
- A new approach to all-pairs shortest paths on real-weighted graphs
- More algorithms for all-pairs shortest paths in weighted graphs
- Title not available (Why is that?)
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Fast rectangular matrix multiplication and applications
- All-pairs small-stretch paths
- STACS 2005
- Faster algorithms for all-pairs small stretch distances in weighted graphs
Cited In (5)
- \(f\)-sensitivity distance oracles and routing schemes
- Distributed distance computation and routing with small messages
- All-pairs small-stretch paths
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- Faster algorithms for all-pairs small stretch distances in weighted graphs
This page was built for publication: Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458845)
