On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion

DOI10.1007/978-3-319-13524-3_3zbMath1380.68210arXiv1407.7156OpenAlexW1777161231MaRDI QIDQ2946005

N. R. Aravind, Naveen Sivadasan, R. B. Sandeep

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Edge deletion problems: branching facilitated by modular decomposition

This page was built for publication: On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion