A good algorithm for smallest spanning trees with a degree constraint
- 1 September 1978
- Vol. 8 (3) , 201-208
- https://doi.org/10.1002/net.3230080304
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The complexity of the capacitated tree problemNetworks, 1978
- Finding optimum branchingsNetworks, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975
- Optimum Communication Spanning TreesSIAM Journal on Computing, 1974
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956