15 citations · 19 across the 3 of their papers we have counts for
1 paper · 1 filter
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…