Parameterized algorithms for Graph Burning problem

DOI10.1007/978-3-030-25005-8_25OpenAlexW2957555567MaRDI QIDQ2301751

Anjeneya Swami Kare, I. Vinod Reddy

Publication date: 25 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-25005-8_25

Mathematics Subject Classification ID

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

Related Items (8)

Burning grids and intervals ⋮ A survey of graph burning ⋮ Parameterized complexity of graph burning ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Burn and win ⋮ Parameterized Complexity of Graph Burning ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem

This page was built for publication: Parameterized algorithms for Graph Burning problem