Approximation and Kernelization for Chordal Vertex Deletion
From MaRDI portal
Publication:4575834
DOI10.1137/1.9781611974782.91zbMath1410.68300arXiv1605.03001OpenAlexW2374265145MaRDI QIDQ4575834
Marcin Pilipczuk, Bart M. P. Jansen
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.03001
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Approximation algorithms (68W25)
Related Items (11)
Recent techniques and results on the Erdős-Pósa property ⋮ A polynomial kernel for block graph deletion ⋮ Polynomial Kernel for Interval Vertex Deletion ⋮ On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unit interval vertex deletion: fewer vertices are relevant ⋮ Vertex deletion problems on chordal graphs ⋮ Packing and Covering Induced Subdivisions ⋮ A polynomial kernel for bipartite permutation vertex deletion ⋮ Vertex Deletion Problems on Chordal Graphs
This page was built for publication: Approximation and Kernelization for Chordal Vertex Deletion
