On the Simultaneous Minimum Spanning Trees Problem
- 16 January 2018
- book chapter
- Published by Springer Nature
- p. 235-248
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Efficient algorithms for graphic matroid intersection and parity2005
- An optimal minimum spanning tree algorithmJournal of the ACM, 2002
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- Reducibility among Combinatorial Problems1972
- 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