Burning a graph is hard (Q2410223)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Burning a graph is hard |
scientific article |
Statements
Burning a graph is hard (English)
0 references
17 October 2017
0 references
graph burning
0 references
computational complexity
0 references
NP-completeness
0 references
3-partition
0 references
polynomial time algorithm
0 references
approximation algorithm
0 references
0 references
