Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:citation |
gptkb:A_new_approach_to_the_minimum_cut_problem_(Karger_&_Stein,_1996)
|
| gptkbp:expectedTimeComplexity |
O(n^2 log^3 n)
|
| gptkbp:field |
computer science
graph theory |
| gptkbp:improves |
gptkb:Karger’s_algorithm
|
| gptkbp:input |
gptkb:graph
|
| gptkbp:introducedIn |
1996
|
| gptkbp:namedAfter |
gptkb:David_Karger
gptkb:Clifford_Stein |
| gptkbp:output |
minimum cut
|
| gptkbp:solvedBy |
minimum cut problem
|
| gptkbp:type |
gptkb:randomized_algorithm
|
| gptkbp:uses |
random edge contraction
|
| gptkbp:bfsParent |
gptkb:Karger’s_algorithm
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Karger–Stein algorithm
|