Solving hard cut problems via flow-augmentation
From MaRDI portal
Recommendations
- Directed flow-augmentation
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- On Weighted Graph Separation Problems and Flow Augmentation
- Designing FPT algorithms for cut problems using randomized contractions
- Cutting up is hard to do: the parameterised complexity of k-cut and related problems
Cited in
(12)- The complexity of resilience problems via valued constraint satisfaction problems
- Flow-augmentation. II: Undirected graphs
- On Weighted Graph Separation Problems and Flow Augmentation
- Flow-augmentation. I: Directed graphs
- Cuts in graphs with matroid constraints
- Parameterized complexity of MinCSP over the point algebra
- Almost consistent systems of linear equations
- Directed flow-augmentation
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- Parameterized complexity classification for interval constraints
- Flow-augmentation. III: Complexity dichotomy for Boolean CSPS parameterized by the number of unsatisfied constraints
This page was built for publication: Solving hard cut problems via flow-augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6147257)
