Complexity of spanning tree problems: Part I
- 30 November 1980
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 5 (5) , 346-352
- https://doi.org/10.1016/0377-2217(80)90164-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The complexity of the network design problemNetworks, 1978
- The complexity of the capacitated tree problemNetworks, 1978
- The min-max spanning tree problem and some extensionsInformation Processing Letters, 1978
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Computing capacitated minimal spanning trees efficientlyNetworks, 1974
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957