More algorithms for all-pairs shortest paths in weighted graphs
Author:
Open Access
- 11 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 590-598
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Almost tight upper bounds for vertical decompositions in four dimensionsJournal of the ACM, 2004
- Improved algorithm for all pairs shortest pathsInformation Processing Letters, 2004
- A new approach to all-pairs shortest paths on real-weighted graphsTheoretical Computer Science, 2004
- All pairs shortest paths using bridging sets and rectangular matrix multiplicationJournal of the ACM, 2002
- Fly Cheaply: On the Minimum Fuel Consumption ProblemJournal of Algorithms, 2001
- Color-codingJournal of the ACM, 1995
- A new upper bound on the complexity of the all pairs shortest path problemInformation Processing Letters, 1992
- Computing dominances in EnInformation Processing Letters, 1991
- A more efficient algorithm for the min-plus multiplicationInternational Journal of Computer Mathematics, 1990
- Shortest paths in euclidean graphsAlgorithmica, 1986