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 …

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 …

Abstract The Network Decontamination problem consists of coordinating a team of mobile
agents in order to clean a contaminated network. The problem is actually equivalent to …

This paper tackles the well known graph searching problem, where a team of searchers
aims at capturing an intruder in a network, modeled as a graph. This problem has been …

In this paper, we consider the problem of finding the minimum number of searchers to sweep
networks/graphs with special topological structures. Such a number is called the search …

The pathwidth of a graph G is the minimum clique number of H minus one, over all interval
supergraphs H of G. We prove in this paper that the pathwidth problem is NP-hard for …

We present a distributed algorithm to compute the node search number in trees. This
algorithm extends the centralized algorithm proposed by Ellis et al.(Inf. Comput. 113 (1): 50 …

In this paper, we study the problem of computing the minimum number of searchers who can
capture an intruder hiding in a graph. We propose a linear time algorithm for computing the …

Search games in graphs have attracted significant attention in recent years, and they have
applications in securing computer networks against viruses and intruders. Since graph …

We give a linear-time algorithm for computing the edge search number of cographs, thereby
resolving the computational complexity of edge searching on this graph class. To achieve …