The snow team problem (clearing directed subgraphs by mobile agents)

DOI10.1007/978-3-662-55751-8_16zbMath1495.68165arXiv1712.00316OpenAlexW2912246957MaRDI QIDQ1679971

Dariusz Dereniowski, Dorota Urbańska, Paweł Żyliński, Andrzej Lingas, Mia Persson

Publication date: 22 November 2017

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

zbMATH Keywords

monomialNP-hardnessgraph searchingFPT-algorithm

Mathematics Subject Classification ID

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)

This page was built for publication: The snow team problem (clearing directed subgraphs by mobile agents)