Parameterized Complexity of Graph Burning

Graph Burning asks, given a graph G = ( V , E ) and an integer k , whether there exists ( b 0 , ⋯ , b k - 1 ) ∈ 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 parameterize...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 84; H. 8; S. 2379 - 2393
Hauptverfasser:	Kobayashi, Yasuaki, Otachi, Yota
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2022 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Parameterization Parameters Polynomials Special Issue: Parameterized and Exact Computation (IPEC 2020) Theory of Computation Fixed-parameter tractability Parameterized complexity Graph burning
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!