Parameterized algorithms for Graph Burning problem

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

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

Recommendations

• Parameterized Complexity of Graph Burning
• Parameterized complexity of graph burning
• Approximation algorithms for graph burning
• Parameterized algorithms for graph partitioning problems
• Parameterized algorithms for graph partitioning problems
• Algorithms and experiments for parameterized approaches to hard graph problems
• Fast dynamic graph algorithms for parameterized problems
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
• Parameterized algorithms for edge biclique and related problems

Mathematics Subject Classification ID

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

Cited In (11)

• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
• Burning and \(w\)-burning of geometric graphs
• Burning grids and intervals
• Backdoor DNFs
• Orientable burning number of graphs
• A survey of graph burning
• APX-hardness and approximation for the \(k\)-burning number problem
• Parameterized Complexity of Graph Burning
• Parameterized complexity of graph burning
• APX-hardness and approximation for the \(k\)-burning number problem
• Burn and win

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

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