Clearing directed subgraphs by mobile agents : Variations on covering with paths
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 i