Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
minimum spanning tree algorithm |
| gptkbp:complexity |
O(E log V)
|
| gptkbp:countryOfPublication |
Czech
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstPublished |
gptkb:Práce_moravské_přírodovědecké_společnosti
|
| https://www.w3.org/2000/01/rdf-schema#label |
Borůvka's algorithm
|
| gptkbp:input |
connected, weighted, undirected graph
|
| gptkbp:inventedBy |
gptkb:Otakar_Borůvka
1926 |
| gptkbp:notable_for |
parallelizability
|
| gptkbp:original_application |
electrification of Moravia
|
| gptkbp:otherName |
gptkb:Sollin's_algorithm
|
| gptkbp:output |
minimum spanning tree
|
| gptkbp:purpose |
finding a minimum spanning tree in a graph
|
| gptkbp:relatedTo |
gptkb:Kruskal's_algorithm
gptkb:Prim's_algorithm |
| gptkbp:step |
repeatedly adds the cheapest edge from each component
|
| gptkbp:used_in |
electrical engineering
network design |
| gptkbp:bfsParent |
gptkb:Prim's_algorithm
|
| gptkbp:bfsLayer |
6
|