Algorithms for burning schedule reconfiguration problem on path forests

DOI10.1007/978-3-032-00281-5_21MaRDI QIDQ6866958zbMATH OpenFDO

Authors Astuki Nagao, Sawako Ogawa

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-3-032-00281-5_21

zbMATH Keywords

combinatorial reconfigurationgraph algorithmgraph burning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Applications of game theory (91A80)

Cites work

• APX-hardness and approximation for the \(k\)-burning number problem
• 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 graph products
• On the complexity of reconfiguration problems
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

This page was built for publication: Algorithms for burning schedule reconfiguration problem on path forests

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