1 paper
Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos +1
We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded conne…