New heuristics for burning connected graphs
The concept of graph burning and burning number (bn(G)) of a graph G was introduced recently [4]. Graph burning models the spread of contagion (fire) in a graph in discrete time steps. bn(G) is the minimum time needed to burn a graph G. The problem is NP-complete. In this paper, we develop first heu...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2022-09-01
|
| Series: | AUT Journal of Mathematics and Computing |
| Subjects: | |
| Online Access: | https://ajmc.aut.ac.ir/article_4911_40d37084dba40edae5928d8f7331634d.pdf |