A faster deterministic algorithm for minimum spanning trees
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 8 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
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975