All pairs lightest shortest paths
Author:
Open Access
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 61-69
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Fast Rectangular Matrix Multiplication and ApplicationsJournal of Complexity, 1998
- All Pairs Shortest Distances for Graphs with Small Integer Length EdgesInformation and Computation, 1997
- All Pairs Shortest Paths for Graphs with Small Integer Length EdgesJournal of Computer and System Sciences, 1997
- Rectangular Matrix Multiplication RevisitedJournal of Complexity, 1997
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functionsAlgorithmica, 1996
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- A note on two problems in connexion with graphsNumerische Mathematik, 1959