An FPT algorithm for elimination distance to bounded degree graphs

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

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

11 Scopus citations

Abstract

In the literature on parameterized graph problems, there has been an increased effort in recent years aimed at exploring novel notions of graph edit-distance that are more powerful than the size of a modulator to a specific graph class. In this line of research, Bulian and Dawar [Algorithmica, 2016] introduced the notion of elimination distance and showed that deciding whether a given graph has elimination distance at most k to any minor-closed class of graphs is fixed-parameter tractable parameterized by k [Algorithmica, 2017]. They showed that Graph Isomorphism parameterized by the elimination distance to bounded degree graphs is fixed-parameter tractable and asked whether determining the elimination distance to the class of bounded degree graphs is fixed-parameter tractable. Recently, Lindermayr et al. [MFCS 2020] obtained a fixed-parameter algorithm for this problem in the special case where the input is restricted to K5-minor free graphs. In this paper, we answer the question of Bulian and Dawar in the affirmative for general graphs. In fact, we give a more general result capturing elimination distance to any graph class characterized by a finite set of graphs as forbidden induced subgraphs.

Original languageEnglish
Title of host publication38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021
EditorsMarkus Blaser, Benjamin Monmege
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771801
DOIs
StatePublished - 1 Mar 2021
Externally publishedYes
Event38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021 - Virtual, Saarbrucken, Germany
Duration: 16 Mar 202119 Mar 2021

Publication series

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

Conference

Conference38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021
Country/TerritoryGermany
CityVirtual, Saarbrucken
Period16/03/2119/03/21

Keywords

  • Elimination Distance
  • Fixed-parameter Tractability
  • Graph Modification

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'An FPT algorithm for elimination distance to bounded degree graphs'. Together they form a unique fingerprint.

Cite this