1 paper · 1 filter
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula +2
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 initia…