Directed flow-augmentation
From MaRDI portal
Recommendations
- Solving hard cut problems via flow-augmentation
- On Weighted Graph Separation Problems and Flow Augmentation
- Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
- Directed subset feedback vertex set is fixed-parameter tractable
- Multi-budgeted directed cuts
Cited in
(17)- On the parameterized complexity of symmetric directed multicut
- The complexity of resilience problems via valued constraint satisfaction problems
- Flow-augmentation. II: Undirected graphs
- Solving hard cut problems via flow-augmentation
- On Weighted Graph Separation Problems and Flow Augmentation
- Flow-augmentation. I: Directed graphs
- Cuts in graphs with matroid constraints
- List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
- Parameterized complexity of MinCSP over the point algebra
- Parameterized approximation algorithms for weighted vertex cover
- 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
- An FPT algorithm for temporal graph untangling
- Parameterized complexity classification for interval constraints
- Flow-augmentation. III: Complexity dichotomy for Boolean CSPS parameterized by the number of unsatisfied constraints
- An FPT algorithm for timeline cover
- Parameterized approximation algorithms for weighted vertex cover
This page was built for publication: Directed flow-augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083547)
