A Unified View of Graph Searching

The end-vertex problem for a search algorithm asks whether a vertex of the input graph is the last visited vertex of an execution of that search algorithm. We consider the end-vertex problem restricted to AT-free bigraphs for various search ...

Megiddo et al. (1988) introduced the edge searching problem, which is to find the minimum number of searchers to capture the robber in the edge searching model. Dyer et al. (2008) introduced the fast searching problem that is to find the minimum ...${}^{\mathrm{}}$$$

In graph searching, a team of searchers is aiming at capturing a fugitive moving in a graph. In the initial variant, called invisible graph searching, the searchers do not know the position of the fugitive until they catch it. In another variant, the ...