Burning Graphs Through Farthest-First Traversal

Graph burning is a process to determine the spreading of information in graph. If sequence vertices burns all graph by following process, then such known as sequence. The problem consists finding minimum length for given solution this NP-hard combinatorial optimization helps quantify graph’s vulnerability contagion. This paper introduces simple farthest-first traversal-based approximation algorithm over arbitrary graphs. We refer proposal Burning Farthest-First (BFF) algorithm. BFF runs $O(n^{3})$ steps and has tight factor notation="LaTeX">$3-2/b(G)$ , where notation="LaTeX">$b(G)$ size an optimal solution. main attribute that it better than state-of-the-art algorithms graphs, which report 3. Despite being simple, proved practical when tested some benchmark datasets.