This paper surveys recent results in pursuit-evasion and autonomous search relevant to
applications in mobile robotics. We provide a taxonomy of search problems that highlights …

This papers surveys some of the work done on trying to capture an intruder in a graph. If the
intruder may be located only at vertices, the term searching is employed. If the intruder may …

Graph searching encompasses a wide variety of combinatorial problems related to the
problem of capturing a fugitive residing in a graph using the minimum number of searchers …

Graphs measure interactions between objects such as friendship links on Twitter,
transactions between Bitcoin users, and the flow of energy in a food chain. While graphs …

Cops-and-robbers games are played on graphs: from their initial positions on some vertices
the cops try to capture (occupy the same vertices as) the robbers, initially on some other …

Suppose that there is a robber hiding on vertices or along edges of a graph or digraph.
Graph searching is concerned with finding the minimum number of searchers required to …

In this article we consider the decontamination problem in a hypercube network of size n.
The nodes of the network are assumed to be contaminated and they have to be …

Searching a network for intruders is an interesting and often difficult problem. Swee** (or
edge searching) is one such search model, in which intruders may exist anywhere along an …

In this paper we consider a network where an intruder is moving" contaminating" the nodes it
passes by, and we focus on the problem of decontaminating such a network by a team of …

In the graph searching game the opponents are a set of searchers and a fugitive in a graph.
The searchers try to capture the fugitive by applying some sequence of moves that include …