Exact and Approximate Distances in Graphs — A Survey
Author:
- 17 August 2001
- book chapter
- Published by Springer Nature
- p. 33-48
Abstract
No abstract availableKeywords
This publication has 72 references indexed in Scilit:
- 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
- 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
- Shortest paths algorithms: Theory and experimental evaluationMathematical Programming, 1996
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Witnesses for Boolean matrix multiplication and for shortest paths1992
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Complexity of network synchronizationJournal of the ACM, 1985
- Lower bounds for algebraic computation trees1983