We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H = (VH, AH) of D such that (a) S ⊆ VH, (b) H is the union of k directed walks in D, and (c) the underlying graph of H includes a Steiner tree for S. We provide several results on parameterized complexity and hardness of the problems.
CITATION STYLE
Dereniowski, D., Lingas, A., Persson, M., Urbańska, D., & Żyliński, P. (2017). The snow team problem: (Clearing Directed subgraphs by mobile agents). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10472 LNCS, pp. 190–203). Springer Verlag. https://doi.org/10.1007/978-3-662-55751-8_16
Mendeley helps you to discover research relevant for your work.