Parameterized complexity of firefighting

DOI10.1016/j.jcss.2014.03.001zbMath1411.68046WikidataQ57359593 ScholiaQ57359593MaRDI QIDQ2453548

Michael R. Fellows, Cristina Bazgan, Marek Cygan, Fedor V. Fomin, Morgan Chopin, Erik Jan van Leeuwen

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.03.001

zbMATH Keywords

fixed parameter tractability; kernelization; firefighter problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)