|
|
|
Bor¿vka's Algorithm: Minimum spanning tree, Otakar Bor¿vka, Electric power distribution
|
(Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!
| Lieferstatus: |
 i.d.R. innert 7-14 Tagen versandfertig |
| Veröffentlichung: |
Mai 2026
|
| Genre: |
Schulbücher |
| ISBN: |
9786136191294 |
|
EAN-Code:
|
9786136191294 |
| Verlag: |
Omniscriptum |
| Einband: |
Kartoniert |
| Sprache: |
English
|
| Dimensionen: |
H 220 mm / B 150 mm / D 4 mm |
| Gewicht: |
107 gr |
| Seiten: |
60 |
| Bewertung: |
Titel bewerten / Meinung schreiben
|
| Inhalt: |
| Please note that the content of this book primarily consists of articles
available from Wikipedia or other free sources online. Bor¿vka's
algorithm is an algorithm for finding a minimum spanning tree in a graph
for which all edge weights are distinct. It was first published in 1926
by Otakar Bor¿vka as a method of constructing an efficient electricity
network for Moravia. The algorithm was rediscovered by Choquet in 1938;
again by Florek, ¿ukasiewicz, Perkal, Steinhaus, and Zubrzycki in 1951;
and again by Sollin in 1965. Because Sollin was the only computer
scientist in this list living in an English speaking country, this
algorithm is frequently called Sollin's algorithm, especially in the
parallel computing literature. |
|
Newsfeed | 
Facebook | 
Twitter
