An algorithm for k^th minimum spanning tree

DOI10.1016/J.ENDM.2016.05.029MaRDI QIDQ327676zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1910742
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
• The minimum spanning tree problem on a planar graph
• The computational complexity of the k-minimum spanning tree problem in graded matrices
• The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm

Cites work

• A good algorithm for smallest spanning trees with a degree constraint
• An Algorithm for Finding K Minimum Spanning Trees
• Finding the \(k\) smallest spanning trees
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Topological design of centralized computer networks—formulations and algorithms
• Two Algorithms for Generating Weighted Spanning Trees in Order

Cited in

(13)

• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• The computational complexity of the k-minimum spanning tree problem in graded matrices
• An improved algorithm for the k-source maximum eccentricity spanning trees
• A randomized linear-time algorithm for finding minimum spanning trees (extended abstract)
• On recursive computation of minimum spanning trees for special partial graphs
• scientific article; zbMATH DE number 3974972 (Why is no real title available?)
• scientific article; zbMATH DE number 3978859 (Why is no real title available?)
• Minimum Spanning Trees in k-Dimensional Space
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
• scientific article; zbMATH DE number 1910742 (Why is no real title available?)
• The Filter-Kruskal Minimum Spanning Tree Algorithm
• On the problem of finding all minimum spanning trees
• An efficient algorithm to find all minimum spanning trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327676)