Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
From MaRDI portal
Publication:5111388
DOI10.4230/LIPIcs.ICALP.2017.57zbMath1441.68185OpenAlexW2962770805MaRDI QIDQ5111388
Michał Pilipczuk, Jean-Florent Raymond, Archontia C. Giannopoulou, Marcin Wrochna, Dimitrios M. Thilikos
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/lipics.icalp.2017.57
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (10)
A Retrospective on (Meta) Kernelization ⋮ The power of cut-based parameters for computing edge-disjoint paths ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Cutwidth: obstructions and algorithmic aspects ⋮ Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes ⋮ A Menger-like property of tree-cut width ⋮ Bidimensionality and Kernels ⋮ Modification to Planarity is Fixed Parameter Tractable ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms ⋮ Partitioning a graph into small pieces with applications to path transversal
This page was built for publication: Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
