A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
From MaRDI portal
Publication:2802923
DOI10.1007/978-3-662-49529-2_1zbMath1417.68145arXiv1510.08154OpenAlexW2205964593MaRDI QIDQ2802923
Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Sudeshna Kolay
Publication date: 3 May 2016
Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.08154
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
Faster exact algorithms for some terminal set problems ⋮ Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property ⋮ Towards constant-factor approximation for chordal/distance-hereditary vertex deletion ⋮ A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion ⋮ A polynomial kernel for block graph deletion ⋮ Polynomial Kernel for Interval Vertex Deletion ⋮ Computing densest \(k\)-subgraph with structural parameters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Vertex deletion on split graphs: beyond 4-hitting set
This page was built for publication: A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
