Approximation Algorithms for the Graph Burning on Cactus and Directed Trees

Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani

Given a graph $G=(V,E)$, the problem of Graph Burning is to find a sequence of nodes from $V$, called a burning sequence, to burn the whole graph. This is a discrete-step process,…