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

zbMath1271.01017MaRDI QIDQ1946015

Jaroslav Nešetřil, Helena Nesetrilová

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

zbMATH Keywords

minimal spanning treeBorůvkahistory of computingJarník

Mathematics Subject Classification ID

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

Related Items (3)

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

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