Flow-augmentation. I: Directed graphs
From MaRDI portal
Cites work
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Combinatorial optimization. Theory and algorithms.
- Constant ratio fixed-parameter approximation of the edge multicut problem
- Designing FPT algorithms for cut problems using randomized contractions
- Directed flow-augmentation
- Directed multicut is W[1]-hard, even for four terminal pairs
- Directed subset feedback vertex set is fixed-parameter tractable
- Finding small separators in linear time via treewidth reduction
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
- Flow-augmentation. II: Undirected graphs
- Flow-augmentation. III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
- List H-coloring a graph by removing few vertices
- List H-coloring a graph by removing few vertices
- Minimum bisection is fixed-parameter tractable
- Multi-budgeted directed cuts
- On Weighted Graph Separation Problems and Flow Augmentation
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
- Parameterized algorithms
- Parameterized and Exact Computation
- Parameterized complexity of weighted multicut in trees
- Parameterized graph separation problems
- Randomized Contractions Meet Lean Decompositions
- Solving hard cut problems via flow-augmentation
- When recursion is better than iteration: a linear-time algorithm for acyclicity with few error vertices
Cited in
(1)
This page was built for publication: Flow-augmentation. I: Directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854560)
