Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- 1 June 1986
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 6 (2), 109-122
- https://doi.org/10.1007/bf02579168
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Linear verification for spanning treesCombinatorica, 1985
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- Efficient algorithms for a family of matroid intersection problemsJournal of Algorithms, 1984
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A note on finding optimum branchingsNetworks, 1979
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- A simple derivation of edmonds' algorithm for optimum branchingsNetworks, 1971
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967