Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- 1 June 1994
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 48 (3) , 533-551
- https://doi.org/10.1016/s0022-0000(05)80064-9
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computationCommunications of the ACM, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976