Chordless Cycle Packing Is Fixed-Parameter Tractable
From MaRDI portal
Publication:5874543
DOI10.4230/LIPIcs.ESA.2020.71OpenAlexW3082731272MaRDI QIDQ5874543
Publication date: 7 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12937/pdf/LIPIcs-ESA-2020-71.pdf/
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chordal editing is fixed-parameter tractable
- Kernel bounds for path and cycle problems
- Finding odd cycle transversals.
- Disjoint cycles intersecting a set of vertices
- Chordal deletion is fixed-parameter tractable
- Mangoes and blueberries
- The node-deletion problem for hereditary properties is NP-complete
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Packing directed circuits
- Automated generation of search tree algorithms for hard graphs modification problems
- Packing cycles through prescribed vertices
- On the parameterized complexity of graph modification to first-order logic properties
- Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3--5, 2015. Proceedings
- Odd cycle packing
- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Edge-Deletion Problems
- Node-Deletion Problems on Bipartite Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Approximation and Kernelization for Chordal Vertex Deletion
- Erd\H{o}s-P\'osa property of chordless cycles and its applications
- Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
- On Independent Circuits Contained in a Graph
- The Graph Minor Algorithm with Parity Conditions
- Parameterized Algorithms
This page was built for publication: Chordless Cycle Packing Is Fixed-Parameter Tractable
