Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

DOI10.1145/3284356zbMath1454.68088arXiv1707.04917OpenAlexW2904185472MaRDI QIDQ4629981

Saket Saurabh, Akanksha Agrawal, Meirav Zehavi, Daniel Lokshtanov, Pranabendu Misra

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.04917

zbMATH Keywords

chordal graphparameterized complexitykernelizationchordal vertex deletion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (12)

Towards constant-factor approximation for chordal/distance-hereditary vertex deletion ⋮ A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion ⋮ A polynomial kernel for 3-leaf power deletion ⋮ Polynomial Kernel for Interval Vertex Deletion ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Unnamed Item ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Unnamed Item ⋮ Chordless Cycle Packing Is Fixed-Parameter Tractable ⋮ Unnamed Item ⋮ Subexponential parameterized algorithms and kernelization on almost chordal graphs ⋮ A polynomial kernel for distance-hereditary vertex deletion

This page was built for publication: Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion