Saving Critical Nodes with Firefighters is FPT

DOI10.4230/LIPIcs.ICALP.2017.135zbMath1442.68165arXiv1705.10923OpenAlexW2963193271MaRDI QIDQ5111467

No author found.

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1705.10923

zbMATH Keywords

kernelizationFPTcutsfirefighting

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Deletion to scattered graph classes. I: Case of finite number of graph classes ⋮ Unnamed Item

This page was built for publication: Saving Critical Nodes with Firefighters is FPT