Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
Authors:
- Stavros G KolliopoulosSKStavros G Kolliopoulos
- Clifford SteinCSClifford Stein
Open Access
- 1 July 1998
- journal article
- research article
- Published by Elsevier in Journal of Algorithms
- Vol. 28 (1) , 125-141
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A new approach to the minimum cut problemJournal of the ACM, 1996
- On the All-Pairs-Shortest-Path Problem in Unweighted Undirected GraphsJournal of Computer and System Sciences, 1995
- A randomized linear-time algorithm to find minimum spanning treesJournal of the ACM, 1995
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Scaling algorithms for network problemsJournal of Computer and System Sciences, 1985
- An algorithm to solve the m × n assignment problem in expected time O(mn log n)Networks, 1980
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955