Burning a graph is hard

Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We prove that the corresponding graph deci...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 232; S. 73 - 87
Hauptverfasser: Bessy, Stéphane, Bonato, Anthony, Janssen, Jeannette, Rautenbach, Dieter, Roshanbin, Elham
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 11.12.2017
Elsevier BV
Elsevier
Schlagworte:
3-partition
Algorithms
Approximation
Approximation algorithm
Burning rate
Computational complexity
Computer Science
Discrete Mathematics
Forests
Graph burning
Graphs
Mathematical analysis
Mathematics
NP-complete
Polynomial time algorithm
Polynomials
3-partition
NP-complete
Graph burning
Polynomial time algorithm
Approximation algorithm
Computational complexity
NP-complete3-partition
ISSN:0166-218X, 1872-6771
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We prove that the corresponding graph decision problem is NP-complete when restricted to acyclic graphs with maximum degree three, spider graphs and path-forests. We provide polynomial time algorithms for finding the burning number of spider graphs and path-forests if the number of arms and components, respectively, are fixed. Finally, we describe a polynomial time approximation algorithm with approximation factor 3 for general graphs.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2017.07.016