Chordless Cycle Packing Is Fixed-Parameter Tractable
From MaRDI portal
Cites work
- A 4k^2 kernel for feedback vertex set
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Algorithmic Aspects of Vertex Elimination on Graphs
- Approximation and kernelization for chordal vertex deletion
- Automated generation of search tree algorithms for hard graphs modification problems
- Chordal deletion is fixed-parameter tractable
- Chordal editing is fixed-parameter tractable
- Disjoint cycles intersecting a set of vertices
- Edge-Deletion Problems
- Erdős-Pósa property of chordless cycles and its applications
- Feedback vertex set inspired kernel for chordal vertex deletion
- Finding odd cycle transversals.
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3--5, 2015. Proceedings
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- Kernel bounds for path and cycle problems
- Mangoes and blueberries
- Node-Deletion Problems on Bipartite Graphs
- Odd cycle packing
- On Independent Circuits Contained in a Graph
- On the parameterized complexity of graph modification to first-order logic properties
- Packing cycles through prescribed vertices
- Packing directed circuits
- Parameterized algorithms
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- The Graph Minor Algorithm with Parity Conditions
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(2)
This page was built for publication: Chordless Cycle Packing Is Fixed-Parameter Tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874543)
