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.
Articles by others on the same topic
There are currently no matching articles.