A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
type: Item
instance of: scholarly article
title: A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
zbMATH Open document ID: 1417.68145
DOI: 10.1007/978-3-662-49529-2_1
author: Akanksha Agrawal
author: Sudeshna Kolay
author: Daniel Lokshtanov
author: Saket Saurabh
published in: LATIN 2016: Theoretical Informatics
publication date: 2016-05-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1510.08154
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6576655
MaRDI profile type: Publication
OpenAlex ID: W2205964593
arXiv ID: 1510.08154
Recommended article: Faster FPT algorithms for deletion to pairs of graph classes
Recommended article: An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Recommended article: An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
Recommended article: An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion
Recommended article: An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion
Recommended article: Q5363781
Recommended article: A polynomial kernel for block graph deletion
Recommended article: FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
Recommended article: Faster parameterized algorithms for two vertex deletion problems
Recommended article: Faster parameterized algorithm for cluster vertex deletion
description: scientific article