Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
graph
|
| gptkbp:defines |
The cut-set is the set of edges with endpoints in both subsets.
A cut is a partition of the vertices of a graph into two disjoint subsets. |
| gptkbp:describes |
partition of vertices
|
| gptkbp:field |
gptkb:mathematics
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Cut (graph theory)
|
| gptkbp:relatedTo |
network flow
minimum cut edge cut maximum cut |
| gptkbp:seeAlso |
edge connectivity
vertex connectivity bridge (graph theory) vertex cut |
| gptkbp:usedIn |
gptkb:max-flow_min-cut_theorem
combinatorial optimization network reliability graph partitioning |
| gptkbp:bfsParent |
gptkb:CUT
|
| gptkbp:bfsLayer |
5
|