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

DOI10.1016/j.endm.2007.01.044zbMath1291.05102OpenAlexW2066671281MaRDI QIDQ3439600

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

minimum spanning tree problemdepth-first searchsearch treesbreadth-first search

Mathematics Subject Classification ID

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

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• On the History of the Minimum Spanning Tree 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

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