zbMATH — the first resource for mathematics

The work of Vojtěch Jarník in combinatorial optimization. (Czech) Zbl 1055.01516
Vojtěch Jarník became famous mainly for his achievements in number theory and mathematical analysis. The authors recall, analyse and comment on two of his papers [Acta Soc. Sci. Nat. Moravicae 6, 57–63 (1930; JFM 57.1343.07); Čas. Mat. Fys. 63, 223–235 (1934; Zbl 0009.13106 and JFM 60.0542.01)] (the latter written jointly with M. Kössler) devoted to extremal problems in combinatorics which despite having been overlooked for a long time represent a pioneering contribution to the topics. They emphasize the value of the papers and suggest that the elegant algorithm constructed by V. Jarník to find a minimal spanning tree and later reinvented by R. C. Prim be called the Jarník-Prim algorithm.
See also B. Korte and J. Nesetřil, Vojtech Jarník’s work in combinatorial optimization, Discrete Math. 235, No. 1-3, 1–17 (2001; Zbl 1024.01018).

01A70 Biographies, obituaries, personalia, bibliographies
90C27 Combinatorial optimization
90-03 History of operations research and mathematical programming
Biographic References:
Jarník, Vojtěch