An Algorithm for kth Minimum Spanning Tree
Authors:
- Amal P MAMAmal P M
- Ajish Kumar K SASAjish Kumar K S
- 1 September 2016
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 53, 343-354
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Topological design of centralized computer networks—formulations and algorithmsNetworks, 1982
- An Algorithm for Finding K Minimum Spanning TreesSIAM Journal on Computing, 1981
- A good algorithm for smallest spanning trees with a degree constraintNetworks, 1978
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- 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