Parameterized algorithms for deletion to (r, ℓ)-graphs

Sudeshna Kolay, Fahad Panolan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

For fixed integers r, ℓ ≥ 0, a graph G is called an (r, ℓ)-graph if the vertex set V (G) can be partitioned into r independent sets and ' cliques. This brings us to the following natural parameterized questions: Vertex (r, ℓ)-Partization and Edge (r, ℓ)-Partization. An input to these problems consist of a graph G and a positive integer k and the objective is to decide whether there exists a set S ⊆ V (G) (S ⊆ E(G)) such that the deletion of S from G results in an (r, ℓ)-graph. These problems generalize well studied problems such as Odd Cycle Transversal, Edge Odd Cycle Transversal, Split Vertex Deletion and Split Edge Deletion. We do not hope to get parameterized algorithms for either Vertex (r, ℓ)-Partization or Edge (r, ℓ)- Partization when either of r or ℓ is at least 3 as the recognition problem itself is NP-complete. This leaves the case of r, ℓ ∈ {1, 2}. We almost complete the parameterized complexity dichotomy for these problems by obtaining the following results: 1. We show that Vertex (r, ℓ)-Partization is fixed parameter tractable (FPT) for r, ℓ ∈ {1, 2}. Then we design an O(√log n)-factor approximation algorithms for these problems. These approximation algorithms are then utilized to design polynomial sized randomized Turing kernels for these problems. 2. Edge (r, ℓ)-Partization is FPT when (r, ℓ) ∈ {(1, 2), (2, 1)}. However, the parameterized complexity of Edge (2, 2)-Partization remains open. For our approximation algorithms and thus for Turing kernels we use an interesting finite forbidden induced graph characterization, for a class of graphs known as (r, ℓ)-split graphs, properly containing the class of (r, ℓ)-graphs. This approach to obtain approximation algorithms could be of an independent interest.

Original languageEnglish
Title of host publication35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2015
EditorsPrahladh Harsha, G. Ramalingam
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages420-433
Number of pages14
ISBN (Electronic)9783939897972
DOIs
StatePublished - 1 Dec 2015
Externally publishedYes
Event35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2015 - Bangalore, India
Duration: 16 Dec 201518 Dec 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume45
ISSN (Print)1868-8969

Conference

Conference35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2015
Country/TerritoryIndia
CityBangalore
Period16/12/1518/12/15

Keywords

  • Approximation algorithms
  • FPT
  • Turing kernels

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Parameterized algorithms for deletion to (r, ℓ)-graphs'. Together they form a unique fingerprint.

Cite this