Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes

The problem of deletion of vertices to a hereditary graph class is a well-studied problem in parameterized complexity. Recently, a natural extension of the problem was initiated where we are given a finite set of hereditary graph classes and we determine whether k vertices can be deleted from a give...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 136; pp. 280 - 301
Main Authors:	Jacob, Ashwin, Majumdar, Diptapriyo, Raman, Venkatesh
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2023
Subjects:	Approximation algorithms Bipartite permutation graphs Chordal graphs Fixed-parameter tractability Interval graphs Scattered graph classes Interval graphs Bipartite permutation graphs Scattered graph classes Approximation algorithms Fixed-parameter tractability Chordal graphs
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!