All-pairs shortest paths and the essential subgraph
- 1 May 1995
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 13 (5) , 426-441
- https://doi.org/10.1007/bf01190847
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On finding and updating shortest paths distributivelyJournal of Algorithms, 1992
- Incremental algorithms for minimal length pathsJournal of Algorithms, 1991
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- The shortest-path problem for graphs with random arc-lengthsDiscrete Applied Mathematics, 1985
- On the value of a random minimum spanning tree problemDiscrete Applied Mathematics, 1985
- Generating Sorted Lists of Random NumbersACM Transactions on Mathematical Software, 1980
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- An algorithm for finding the essential sets of arcs of certain graphsJournal of Combinatorial Theory, Series B, 1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959