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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 136; s. 280 - 301
Hlavní autoři: Jacob, Ashwin, Majumdar, Diptapriyo, Raman, Venkatesh
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.09.2023
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 given graph so that the connected components of the resulting graph belong to one of the given hereditary graph classes. The problem is shown to be fixed parameter tractable (FPT) when the deletion problem to each of the given hereditary graph classes is fixed-parameter tractable, and the property of being in any of the graph classes is expressible in the counting monodic second order (CMSO) logic. This paper focuses on pairs of specific graph classes (Π1,Π2) in which we would like the connected components of the resulting graph to belong to, and design simpler and more efficient FPT algorithms.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2023.03.004