Feedback vertex set inspired kernel for chordal vertex deletion
DOI10.1137/1.9781611974782.90zbMATH Open1410.68270OpenAlexW2570928946MaRDI QIDQ4575833FDOQ4575833
Authors: Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Paths and cycles (05C38)
Cited In (12)
- Unit interval vertex deletion: fewer vertices are relevant
- A vertex incremental approach for maintaining chordality
- Approximation and kernelization for chordal vertex deletion
- Approximation and kernelization for chordal vertex deletion
- Feedback vertex set inspired kernel for chordal vertex deletion
- Vertex deletion problems on chordal graphs
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Vertex deletion problems on chordal graphs
- Polynomial Kernel for Interval Vertex Deletion
- A polynomial kernel for block graph deletion
- A polynomial kernel for proper Helly circular-arc vertex deletion
- A polynomial kernel for bipartite permutation vertex deletion
This page was built for publication: Feedback vertex set inspired kernel for chordal vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575833)