All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- All-Pairs Small-Stretch PathsJournal of Algorithms, 2001
- 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
- All-pairs shortest paths and the essential subgraphAlgorithmica, 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
- An algorithm for finding all shortest paths using N2.81 infinite-precision multiplicationsInformation Processing Letters, 1976
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- A note on two problems in connexion with graphsNumerische Mathematik, 1959