Borůvka was born in Uherský Ostroh, a town in Moravia, the son of a school headmaster. He attended the grammar school in Uherské Hradiště beginning in 1910. In 1916, influenced by the ongoing World War I, he moved to the military school in Hranice, and later he enrolled into the military technical academy in Mödling near Vienna. When the war ended, Borůvka returned to Uherské Hradiště, finished his studies in 1918 at the Gymnasium there, and became a student at the Imperial Czech Technical University of Franz Joseph, in Brno, initially studying civil engineering. In 1920, Masaryk University opened in Brno, and Borůvka also began taking courses there. He became an assistant to Mathias Lerch at Masaryk in 1921, but Lerch died in 1922; his position at Masaryk was taken by Eduard Čech, whom Borůvka also assisted, earning his doctorate in 1923. At Čech's suggestion, Borůvka visited Élie Cartan in Paris from 1926 to 1927. He earned his habilitation from Masaryk University in 1927, and he became a docent there in 1928. He continued to travel abroad through the late 1920s and early 1930s, to Cartan in Paris again as well as to Wilhelm Blaschke in Hamburg. He was promoted to assistant professor at Masaryk in 1934, given a chair in 1940, and made an ordinary professor in 1946. In 1965, he founded the new journal Archivum Mathematicum, and in 1969, he became a founding member of the Institute of Mathematics of the Czechoslovak Academy of Sciences, splitting his time between the Institute and his professorship at Masaryk.
Contributions
The problem of designing efficient electric distribution networks had been suggested to Borůvka by his friend Jindřich Saxel, an employee of the West Moravian Power Company, during World War I. In his 1926 paper O jistém problému minimálním, Borůvka solved this problem by modeling it mathematically as a minimum spanning tree problem, and described the first known algorithm for finding the minimum spanning tree of a metric space. Now called Borůvka's algorithm, his method works by repeatedly adding a connections between each subtree of the minimum spanning tree found so far and its nearest neighboring subtree. The same algorithm has been rediscovered repeatedly. It is more suitable for distributed and parallel computation than many other minimum spanning tree algorithms, can achieve linear time complexity on planar graphs and more generally in minor-closed graph families, and plays a central role in the randomized linear time algorithm of. From 1924 to 1935, Borůvka's primary interest was in differential geometry. His work in this area concerned analytic correspondences between projective planes, normal curvature of high-dimensional surfaces, and Frenet formula for curves in high-dimensional spaces. Beginning in the 1930s, Borůvka's interests shifted to abstract algebra, and in particular the theory ofgroups. He was also one of the first to study a generalization of groups, called by him "groupoids" but now more commonly referred to as magmas. A textbook by him on groups and groupoids, originally published in Czech in 1944, went through several expansions, and translations, including an English edition in 1976. Following the war, Borůvka shifted gears again, from algebra to the theory of differential equations. He published several research papers on this subject, as well as a monograph on second-order differential equations which he published in 1971.
