A practical minimum spanning tree algorithm using the cycle property

DOI10.1007/B13632zbMATH Open1266.68226OpenAlexW1827234103MaRDI QIDQ5897286FDOQ5897286

Authors Irit Katriel, Peter Sanders, Jesper Larsson Träff

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Recommendations

• An optimal minimum spanning tree algorithm
• scientific article; zbMATH DE number 1670813
• A Parallel Algorithm for Computing Minimum Spanning Trees
• Minimum-weight spanning tree algorithms. A survey and empirical study
• A simpler minimum spanning tree verification algorithm

Cited in

(9)

• Pairing heaps: the forward variant
• Construction of natural cycletrees
• Minimum spanning tree cycle intersection problem
• On sorting, heaps, and minimum spanning trees
• scientific article; zbMATH DE number 2163020 (Why is no real title available?)
• scientific article; zbMATH DE number 1670813 (Why is no real title available?)
• scientific article; zbMATH DE number 177565 (Why is no real title available?)
• The saga of minimum spanning trees
• Using sparsification for parametric minimum spanning tree problems

This page was built for publication: A practical minimum spanning tree algorithm using the cycle property

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