15 citations · 19 across the 3 of their papers we have counts for
3 papers
Graph burning: an overview of mathematical programs
Lourdes Beatriz Cajica-Maceda, Freddy Alejandro Chaurra-Gutiérrez, Julio César Pérez-Sansalvador +1
The Graph Burning Problem (GBP) is a combinatorial optimization problem that has gained relevance as a tool for quantifying a graph's vulnerability to contagion. Although it is bas…
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 \…
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…