A mathematician whose 1926 work introduced a component-merging method for the minimum spanning tree problem, now called Borůvka's algorithm.[ref]
O jistém problému minimálním by Otakar Borůvka. Original article, 1926, pp. 37–58
Portrait of Otakar Borůvka in 1981
. Via Wikimedia Commons; the linked file page provides image credits and usage information. Source.
Otakar Borůvka was a Czech mathematician known for his contributions to the field of graph theory, particularly for developing Borůvka's algorithm. This algorithm, which he introduced in 1926, is designed for finding the minimum spanning tree of a connected, weighted graph. The algorithm operates by repeatedly adding the shortest edge that connects a vertex to a growing tree until all vertices are included. This work laid the groundwork for subsequent developments in network design and optimization.
New to topics? Read the docs here!