THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context

DOI10.1016/J.ENDM.2007.01.044MaRDI QIDQ3439600zbMATH OpenOpenAlexFDO

Authors Eva Milková

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

breadth-first searchdepth-first searchminimum spanning tree problemsearch trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the History of the Minimum Spanning Tree Problem
• The origins of minimal spanning tree algorithms -- Borůvka and Jarník
• The saga of minimum spanning trees
• The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
• The minimum-area spanning tree problem
• Algorithms and Data Structures
• On the minimum diameter spanning tree problem
• On the simultaneous minimum spanning trees problem
• The minimum stretch spanning tree problem for typical graphs

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 1260937 (Why is no real title available?)
• scientific article; zbMATH DE number 1260938 (Why is no real title available?)
• On the History of the Minimum Spanning Tree Problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
• Vojtěch Jarník's work in combinatorial optimization

Cited in

(1)

• Vojtěch Jarník's work in combinatorial optimization

This page was built for publication: THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context

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