A new approach to all-pairs shortest paths on real-weighted graphs
Author:
- 1 January 2004
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 312 (1) , 47-74
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- An optimal minimum spanning tree algorithmJournal of the ACM, 2002
- A minimum spanning tree algorithm with inverse-Ackermann type complexityJournal of the ACM, 2000
- Undirected single-source shortest paths with positive integer weights in linear timeJournal of the ACM, 1999
- Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected TimeJournal of Algorithms, 1998
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- 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
- Information Bounds Are Weak in the Shortest Distance ProblemJournal of the ACM, 1980
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- A note on two problems in connexion with graphsNumerische Mathematik, 1959