The origins of minimal spanning tree algorithms -- Borůvka and Jarník

MaRDI QIDQ1946015zbMATH OpenFDO

Authors J. Nešetřil, Helena Nešetřilová

Publication date 17 April 2013

Published in Documenta Mathematica (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/DMJDMV/vol-ismp/30_nesetril-nesetrilova.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Borůvkahistory of computingJarníkminimal spanning tree

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of combinatorics (05-03) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) History of operations research and mathematical programming (90-03) Programming involving graphs or networks (90C35)

Review text

This paper discusses some of the history (especially before 1930) of the minimal spanning tree problem and its solution. The authors also write about the lives of the two mathematicians Borůvka and Jarník. Borůvka's original motivation was to solve an engineering problem and in doing so he created the crucial key exchange axiom, which is fundamental for the minimal spanning tree problem.

Recommendations

• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
• scientific article; zbMATH DE number 2098016
• On the History of the Minimum Spanning Tree Problem
• scientific article; zbMATH DE number 2098009
• scientific article; zbMATH DE number 1260938

Cited in

(9)

• A new approach for the multiobjective minimum spanning tree
• A two-level solution approach for solving the generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
• scientific article; zbMATH DE number 1260938 (Why is no real title available?)
• scientific article; zbMATH DE number 2098009 (Why is no real title available?)
• scientific article; zbMATH DE number 2098016 (Why is no real title available?)
• 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

This page was built for publication: The origins of minimal spanning tree algorithms -- Borůvka and Jarník

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