2 citations · 2 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Approximation Algorithms for the Graph Burning on Cactus and Directed Trees
Rahul Kumar Gautam, Anjeneya Swami Kare, S. Durga Bhavani
Given a graph , the problem of Graph Burning is to find a sequence of nodes from , called a burning sequence, to burn the whole graph. This is a discrete-step process,…
cs.DS2022★ 2 cited
Improved Approximation Algorithm for Graph Burning on Trees
Rahul Kumar Gautam, Anjeneya Swami Kare, Durga Bhavani S
Given a graph , the problem of \gb{} is to find a sequence of nodes from , called burning sequence, in order to burn the whole graph. This is a discrete-step process, i…