Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:application |
clustering
image segmentation network reliability |
| gptkbp:complexity |
polynomial time
|
| gptkbp:defines |
The problem of finding the smallest set of edges whose removal disconnects a graph.
|
| gptkbp:field |
computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Minimum cut problem
|
| gptkbp:input |
weighted graph
|
| gptkbp:output |
minimum cut set
|
| gptkbp:relatedTo |
maximum flow problem
global minimum cut problem minimum s-t cut problem |
| gptkbp:solvedBy |
gptkb:Edmonds-Karp_algorithm
gptkb:Ford-Fulkerson_algorithm gptkb:Stoer-Wagner_algorithm |
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|