new heuristics for burning connected graphs

The concept of graph burning and burning number (bn(g)) of a graph g was introduced recently . 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 heuristics to solve the problem in general (connected) graphs. in order to test the performance of our algorithms, we applied them on some graph classes with known burning number such as θ-graphs. we tested our algorithms on dimacs and bhoslib that are known benchmarks for nphard problems in graph theory. we also improved the upper bound for burning number on general graphs in terms of their distance to cluster. then we generated a data set of 1000 random graphs with known distance to cluster and tested our heuristics on them.