A Polynomial Kernel for Block Graph Deletion

In the Block Graph Deletion problem, we are given a graph G on n vertices and a positive integer k , and the objective is to check whether it is possible to delete at most k vertices from G to make it a block graph, i.e., a graph in which each block is a clique. In this paper, we obtain a kernel wit...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 79; no. 1; pp. 251 - 270
Main Authors:	Kim, Eun Jung, Kwon, O-Joung
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.09.2017 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Diamonds Graph theory Graphs Kernels Mathematics of Computing Theory of Computation Block graph Fixed parameter algorithm Block decomposition Kernelization algorithm
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!