On the parameterized complexity of symmetric directed multicut
From MaRDI portal
Cites work
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Approximating directed multicuts
- Approximation Algorithms for Steiner and Directed Multicuts
- Directed flow-augmentation
- Directed multicut is W[1]-hard, even for four terminal pairs
- Directed subset feedback vertex set is fixed-parameter tractable
- Divide-and-conquer approximation algorithms via spreading metrics
- Finding odd cycle transversals.
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
- Fixed-parameter tractability of multicut in directed acyclic graphs
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 2079369 (Why is no real title available?)
- Improved approximation for directed cut problems
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
- Multicut Is FPT
- Parameterized algorithms
- Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
- Parameterized graph separation problems
- Polynomial flow-cut gaps and hardness of directed cut problems
Cited in
(2)
This page was built for publication: On the parameterized complexity of symmetric directed multicut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969001)
