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

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 84; číslo 8; s. 2379 - 2393
Hlavní autori:	Kobayashi, Yasuaki, Otachi, Yota
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2022 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!