The expected complexity of Prim's minimum spanning tree algorithm
Author:
- 28 February 2002
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 81 (4) , 197-201
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- 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
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- A theorem on the expected complexity of dijkstra's shortest path algorithmJournal of Algorithms, 1985
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956