On the parameterized complexity of multiway near-separator
From MaRDI portal
Cites work
- A 4k^2 kernel for feedback vertex set
- An improved parameterized algorithm for the minimum node multiway cut problem
- Approximation and kernelization for chordal vertex deletion
- Clustering to Given Connectivities
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constant factor approximation for tracking paths and fault tolerant feedback vertex set
- Designing FPT algorithms for cut problems using randomized contractions
- FPT algorithms for path-transversal and cycle-transversal problems
- Finding odd cycle transversals.
- Finding small separators in linear time via treewidth reduction
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Graph theory
- Maximal Flow Through a Network
- Multicut Is FPT
- On multiway cut parameterized above lower bounds
- Parameterized algorithms
- Parameterized complexity dichotomy for \textsc{Steiner Multicut}
- Parameterized graph separation problems
- Reducing CMSO model checking to highly connected graphs
- Region growing for multi-route cuts
- Representative sets and irrelevant vertices: new tools for kernelization
- Simple and improved parameterized algorithms for multiterminal cuts
- Subset feedback vertex set is fixed-parameter tractable
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This page was built for publication: On the parameterized complexity of multiway near-separator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926180)
