Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
minimum spanning tree algorithm |
| gptkbp:alsoKnownAs |
gptkb:Borůvka's_algorithm
|
| gptkbp:category |
greedy algorithm
|
| gptkbp:complexity |
O(E log V)
|
| gptkbp:countryOfPublication |
Czech
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:firstPublished |
1926
|
| https://www.w3.org/2000/01/rdf-schema#label |
Sollin's algorithm
|
| gptkbp:input |
connected, weighted, undirected graph
|
| gptkbp:namedAfter |
gptkb:Otakar_Borůvka
Sollin |
| gptkbp:output |
minimum spanning tree
|
| gptkbp:purpose |
find minimum spanning tree
|
| gptkbp:relatedTo |
gptkb:Kruskal's_algorithm
gptkb:Prim's_algorithm |
| gptkbp:step |
repeatedly add the lightest edge connecting each component to another
|
| gptkbp:usedIn |
electrical engineering
telecommunications network design |
| gptkbp:bfsParent |
gptkb:Borůvka's_algorithm
|
| gptkbp:bfsLayer |
7
|