The origins of minimal spanning tree algorithms -- Borůvka and Jarník
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.
scientific article; zbMATH DE number 6155085