Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
connected graphs
|
| gptkbp:complexity |
O(m) in planar graphs
O(n^2) in general graphs |
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Wilson's algorithm
|
| gptkbp:introducedIn |
1996
|
| gptkbp:namedAfter |
gptkb:David_B._Wilson
|
| gptkbp:output |
gptkb:uniform_spanning_tree
|
| gptkbp:property |
randomized algorithm
produces unbiased spanning trees |
| gptkbp:relatedTo |
gptkb:Aldous–Broder_algorithm
|
| gptkbp:usedFor |
generating random spanning trees
|
| gptkbp:uses |
gptkb:loop-erased_random_walk
|
| gptkbp:bfsParent |
gptkb:Broder's_algorithm
|
| gptkbp:bfsLayer |
8
|