Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:category |
gptkb:algorithm
|
| gptkbp:complexity |
O(n^2)
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Karger's algorithm
|
| gptkbp:improves |
gptkb:Karger–Stein_algorithm
|
| gptkbp:input |
graph
|
| gptkbp:output |
minimum cut
|
| gptkbp:probabilityOfSuccess |
at least 2/(n(n-1))
|
| gptkbp:proposedBy |
gptkb:David_Karger
|
| gptkbp:solvedBy |
minimum cut problem
|
| gptkbp:type |
randomized algorithm
|
| gptkbp:uses |
edge contraction
|
| gptkbp:yearProposed |
1993
|
| gptkbp:bfsParent |
gptkb:David_R._Karger
|
| gptkbp:bfsLayer |
7
|