On the problem of finding all minimum spanning trees

DOI10.21711/231766362017/RMC4511MaRDI QIDQ6489481zbMATH OpenFDO

Authors João Guilherme Martinez, Rosiane de Freitas, Altigran Silva

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362017/RMC4511

zbMATH Keywords

algorithmsgraphsminimum spanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)

Recommendations

• Listing all the minimum spanning trees in an undirected graph
• An algorithm for \(k^{\text{th}}\) minimum spanning tree
• The minimum labeling spanning trees
• scientific article; zbMATH DE number 3974972
• The problem of the optimal biobjective spanning tree

This page was built for publication: On the problem of finding all minimum spanning trees

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