A greedy heuristic for graph burning

Jesús García-Díaz, José Alejandro Cornejo-Acosta, Joel Trejo Sánchez

Given a graph $G$, the optimization version of the graph burning problem seeks for a sequence of vertices, $(u_1,u_2,...,u_p)\in V(G{)}^p$, with minimum $p$ and such that every $v \…