A polynomial kernel for distance-hereditary vertex deletion

DOI10.1007/978-3-319-62127-2_43zbMath1494.68198arXiv1610.07229OpenAlexW2540298124MaRDI QIDQ5920109

O-joung Kwon, Eun Jung Kim

Publication date: 22 September 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (7)

Towards constant-factor approximation for chordal/distance-hereditary vertex deletion ⋮ A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion ⋮ Approximation and Kernelization for Chordal Vertex Deletion ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.

This page was built for publication: A polynomial kernel for distance-hereditary vertex deletion