Jesús García-Díaz

activity

20202025

most citedBurning graphs through farthest-first traversal

15 citations · 19 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2025

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…

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 $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 \…