Approximation algorithms for the graph burning on cactus and directed trees

DOI10.1142/S1793830923500969MaRDI QIDQ6983397zbMATH OpenFDO

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

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830923500969

zbMATH Keywords

burning numbergraph burninginformation spreading

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites work

• An upper bound on the burning number of graphs
• Approximation algorithms for graph burning
• Bounds on the burning number
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph as a model of social contagion
• Burning a graph is hard
• Burning number of theta graphs
• Burning two worlds
• How to Burn a Graph
• On the burning number of generalized Petersen graphs
• Parameterized algorithms for Graph Burning problem
• Parameterized complexity of graph burning
• The burning number of directed graphs: bounds and computational complexity

Cited in

(1)

• Burning path-like and clique-like graphs

This page was built for publication: Approximation algorithms for the graph burning on cactus and directed trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983397)