Papers › A greedy heuristic for graph burning
A greedy heuristic for graph burning
Jesús García-Díaz, José Alejandro Cornejo-Acosta, Joel Trejo Sánchez
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Given a graph G, the optimization version of the graph burning problem seeks for a sequence of vertices, (u₁,u₂,...,uₚ) ∈V(G)ᵖ, with minimum p and such that every v ∈V(G) has distance at most p-i to some vertex uᵢ. The length p of the optimal solution is known as the burning number and is denoted by b(G), an invariant that helps quantify the graph's vulnerability to contagion. This paper explores the advantages and limitations of an 𝒪(mn + pn²) deterministic greedy heuristic for this problem, where n is the graph's order, m is the graph's size, and p is a guess on b(G). This heuristic is based on the relationship between the graph burning problem and the clustered maximum coverage problem, and despite having limitations on paths and cycles, it found most of the optimal and best-known solutions of benchmark and synthetic graphs with up to 102400 vertices. Beyond practical advantages, our work unveils some of the fundamental aspects of graph burning: its relationship with a generalization of a classical coverage problem and compact integer programs. With this knowledge, better algorithms might be designed in the future.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections