Minimal ratio spanning trees
- 1 December 1977
- Vol. 7 (4) , 335-342
- https://doi.org/10.1002/net.3230070405
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Matroids and the greedy algorithmMathematical Programming, 1971
- 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