An efficient algorithm to find all minimum spanning trees

DOI10.1093/COMNET/CNAF004MaRDI QIDQ6920917zbMATH OpenFDO

Authors Emmanuel Paradis

Publication date 6 October 2025

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/COMNET/CNAF004

zbMATH Keywords

matrix determinantshortest pathspanning treeTSPLIB

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A randomized linear-time algorithm to find minimum spanning trees
• An algorithm for \(k^{\text{th}}\) minimum spanning tree
• An optimal minimum spanning tree algorithm
• Graph theory with applications
• scientific article; zbMATH DE number 1080078 (Why is no real title available?)
• Listing all the minimum spanning trees in an undirected graph
• On Minimum Spanning Trees and Determinants
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• The saga of minimum spanning trees

This page was built for publication: An efficient algorithm to find all minimum spanning trees

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