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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences Jg. 136; S. 280 - 301
Hauptverfasser:	Jacob, Ashwin, Majumdar, Diptapriyo, Raman, Venkatesh
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.09.2023
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!