zbMATH — the first resource for mathematics

A contemporary view of a “certain minimal problem”. (Czech) Zbl 1056.01007
This is a certain complement to the paper by B. Korte and J. Nešetřil [The work of Vojtěch Jarník in combinatorial optimization. Pokroky Mat. Fyz. Astron. 44, No. 3, 187–200 (1999; Zbl 1055.01516)]. The author gives an overview of the minimum spanning tree problem from its original formulation to the present formulation in graph theory. She presents basic algorithms and shows why the problem is still alive.
01A60 History of mathematics in the 20th century
01A70 Biographies, obituaries, personalia, bibliographies
90C27 Combinatorial optimization
05C35 Extremal problems in graph theory
Full Text: EuDML