Finding Minimum Spanning Trees
- 1 December 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 5 (4), 724-742
- https://doi.org/10.1137/0205051
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Finding optimum branchingsNetworks, 1977
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Connectivity in GraphsPublished by University of Toronto Press Inc. (UTPress) ,1966
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- 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