HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

Parameterized Complexity of Graph Burning

Files in This Item:

The file(s) associated with this item can be obtained from the following URL:

Title: Parameterized Complexity of Graph Burning
Authors: Kobayashi, Yasuaki Browse this author →KAKEN DB
Otachi, Yota Browse this author
Keywords: Graph burning
Parameterized complexity
Fixed-parameter tractability
Issue Date: 19-Jul-2022
Publisher: Springer
Journal Title: Algorithmica
Publisher DOI: 10.1007/s00453-022-00962-8
Abstract: GRAPH BURNING asks, given a graph G = (V, E) and an integer k, whether there exists (b(0), ...,b(k-1)) is an element of V-k such that every vertex in G has distance at most i from some b(i). This problem is known to be NP-complete even on connected caterpillars of maximum degree 3. We study the parameterized complexity of this problem and answer all questions by Kare and Reddy [IWOCA 2019] about the parameterized complexity of the problem. We show that the problem is W[2]-complete parameterized by k and that it does not admit a polynomial kernel parameterized by vertex cover number unless NP subset of coNP/poly. We also show that the problem is fixed-parameter tractable parameterized by clique-width plus the maximum diameter among all connected components. This implies the fixed-parameter tractability parameterized by modular-width, by treedepth, and by distance to cographs. Using a different technique, we show that parameterization by distance to split graphs is also tractable. We finally show that the problem parameterized by max leaf number is XP.
Type: article
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 - Hokkaido University