The following pages link to Compact representations of cuts (Q2706189):
Displaying 12 items.
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- Ancestor tree for arbitrary multi-terminal cut functions (Q1179737) (← links)
- Multiterminal xcut problems (Q1179738) (← links)
- Maximum concurrent flows and minimum cuts (Q1194345) (← links)
- Extracting maximal information about sets of minimum cuts (Q1261290) (← links)
- On the \(k\)-cut subgraph polytope (Q1340072) (← links)
- Canonical cactus representation for miminum cuts (Q1343494) (← links)
- Exact cutting in spaces of cusp forms with characters (Q1668091) (← links)
- Tree packing and approximating \(k\)-cuts (Q2768268) (← links)
- Solution Bases of Multiterminal Cut Problems (Q3820346) (← links)
- Efficient algorithms for generalized cut‐trees (Q3978604) (← links)
- Compacting cuts. A new linear formulation for minimum cut (Q6486921) (← links)
