Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:category |
gptkb:algorithm
|
| gptkbp:citation |
Karger, D. R. (1993). Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. SODA 1993.
|
| gptkbp:expectedTimeComplexity |
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:notableFor |
simplicity
randomized approach to min-cut |
| gptkbp:output |
minimum cut
|
| gptkbp:proposedBy |
gptkb:David_Karger
|
| gptkbp:solvedBy |
minimum cut problem
|
| gptkbp:successProbability |
at least 2/(n(n-1))
|
| gptkbp:type |
randomized algorithm
|
| gptkbp:uses |
edge contraction
|
| gptkbp:yearProposed |
1993
|
| gptkbp:bfsParent |
gptkb:David_Karger
|
| gptkbp:bfsLayer |
5
|