Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

DOI10.1137/1.9781611974782.90zbMath1410.68270OpenAlexW2570928946MaRDI QIDQ4575833

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

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://doi.org/10.1137/1.9781611974782.90

Mathematics Subject Classification ID

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 (8)

A polynomial kernel for block graph deletion ⋮ Approximation and Kernelization for Chordal Vertex Deletion ⋮ Polynomial Kernel for Interval Vertex Deletion ⋮ Unnamed Item ⋮ Unit interval vertex deletion: fewer vertices are relevant ⋮ Vertex deletion problems on chordal graphs ⋮ A polynomial kernel for bipartite permutation vertex deletion ⋮ Vertex Deletion Problems on Chordal Graphs

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