All-Pairs Small-Stretch Paths
- 28 February 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 38 (2) , 335-353
- https://doi.org/10.1006/jagm.2000.1117
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Polylog-time and near-linear work approximation scheme for undirected shortest pathsJournal of the ACM, 2000
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)SIAM Journal on Computing, 1999
- Near-Linear Time Construction of Sparse Neighborhood CoversSIAM Journal on Computing, 1998
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch tSIAM Journal on Computing, 1998
- On the Exponent of the All Pairs Shortest Path ProblemJournal of Computer and System Sciences, 1997
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functionsAlgorithmica, 1996
- NEW SPARSENESS RESULTS ON GRAPH SPANNERSInternational Journal of Computational Geometry & Applications, 1995
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Complexity of network synchronizationJournal of the ACM, 1985