cut (533B)
1 # Cut 2 3 In a [graph], a *cut* is a [partition] of the [vertices] in two sets 4 - There may be a source s and a sink t, and then an *st-cut* is one where the source is on one side and the sink is on the other side 5 - The graph may be [graph_directed] or [graph_undirected] 6 - The correspondance to [network_flow] is in the case of [graph_directed] 7 - An [ideal_cut] is one where there is no [edge] at all going from the right side to the left side 8 9 - [cut_ranked_enumeration] 10 11 Up: [network_flow] 12 13 Aliases: cuts, network cut, network cuts