Burn and win

DOI10.1007/978-3-031-34347-6_4MaRDI QIDQ6182888

Pradeesha Ashok, Avi Tomar, Lawqueen Kanesh, Shaily Verma, Saket Saurabh, Sayani Das

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

treewidthexact algorithmfixed-parameter tractabilitythreshold graphsburning number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Diameter and treewidth in minor-closed graph families
• An upper bound on the burning number of graphs
• On the burning number of \(p\)-caterpillars
• Parameterized complexity of graph burning
• Parameterized algorithms for Graph Burning problem
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• A survey of graph burning
• The Burning Number of Directed Graphs: Bounds and Computational Complexity
• Parameterized Algorithms
• How to Burn a Graph

This page was built for publication: Burn and win