Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Otakar Borůvka

Theory of Computation

Otakar Borůvka was a Czech mathematician, born in 1899 and died in 1995, best known for his work in graph theory. In 1926 he published a method of constructing an efficient electricity network for Moravia, which is now known as Borůvka's algorithm for finding a minimum spanning tree. The algorithm was rediscovered several times afterwards, including by Choquet in 1938 and by Georges Sollin in 1965.

Facts
Birth Year
1899 1
Otakar Borůvka
Filter Results1 entry
Connections

Credited

Source Wikipedia: Boruvka's algorithm

In Field

Source Otakar Borůvka (Wikipedia)

Invented

Source Wikipedia: Boruvka's algorithm
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Otakar Borůvka (Wikipedia)Lead section
Quote, Lead section
was a Czech mathematician
Sources
1. Otakar Borůvka (Wikipedia)
Lead section
Quote, Lead section
10 May 1899
View the Source
Wikipedia: Boruvka's algorithm
  • Credited: Boruvka's Algorithm, Lead section
    It was first published in 1926 by Otakar Borůvka
  • Invented: Boruvka's Algorithm, Lead section
    It was first published in 1926 by Otakar Borůvka
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.