15 citations · 19 across the 2 of their papers we have counts for
2 papers
cs.DM2024★ 4 cited
A greedy heuristic for graph burning
Jesús García-Díaz, José Alejandro Cornejo-Acosta, Joel Trejo Sánchez
Given a graph , the optimization version of the graph burning problem seeks for a sequence of vertices, , with minimum and such that every $v \…
cs.DS2020★ 15 cited
Burning graphs through farthest-first traversal
Jesús García Díaz, Julio César Pérez Sansalvador, Lil María Xibai Rodríguez Henríquez +1
The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify the vulnerability of a graph to contagion. This paper introduces a simple farthest-fi…