An algorithm for \(k^{\text{th}}\) minimum spanning tree

DOI10.1016/j.endm.2016.05.029zbMath1347.05235OpenAlexW2518240130MaRDI QIDQ327676

P. M. Amal, Kumar K. S. Ajish

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.029

zbMATH Keywords

\(k\)th minimum spanning tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Finding the \(k\) smallest spanning trees
• An Algorithm for Finding K Minimum Spanning Trees
• Topological design of centralized computer networks—formulations and algorithms
• Two Algorithms for Generating Weighted Spanning Trees in Order
• A good algorithm for smallest spanning trees with a degree constraint

This page was built for publication: An algorithm for \(k^{\text{th}}\) minimum spanning tree