Chazelle's minimum spanning tree algorithm
GPTKB entity
Statements (18)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:algorithm
|
gptkbp:author |
gptkb:Bernard_Chazelle
|
gptkbp:complexity |
O(m α(m, n))
|
gptkbp:field |
computer science
graph theory |
https://www.w3.org/2000/01/rdf-schema#label |
Chazelle's minimum spanning tree algorithm
|
gptkbp:improves |
gptkb:Kruskal's_algorithm
gptkb:Prim's_algorithm |
gptkbp:input |
connected weighted undirected graph
|
gptkbp:introducedIn |
2000
|
gptkbp:namedAfter |
gptkb:Bernard_Chazelle
|
gptkbp:notableFor |
optimal for sparse graphs
|
gptkbp:output |
minimum spanning tree
|
gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
gptkbp:solvedBy |
minimum spanning tree problem
|
gptkbp:uses |
gptkb:soft_heap
|
gptkbp:bfsParent |
gptkb:soft_heap
|
gptkbp:bfsLayer |
6
|