The origins of minimal spanning tree algorithms -- Borůvka and Jarník (Q1946015)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6155085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The origins of minimal spanning tree algorithms -- Borůvka and Jarník |
scientific article; zbMATH DE number 6155085 |
Statements
The origins of minimal spanning tree algorithms -- Borůvka and Jarník (English)
0 references
17 April 2013
0 references
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.
0 references
minimal spanning tree
0 references
Borůvka
0 references
Jarník
0 references
history of computing
0 references
0.8915516138076782
0 references
0.8857713341712952
0 references
