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 …

The Cops and Robbers game as originally defined independently by Quilliot and by
Nowakowski and Winkler in the 1980s has been much studied, but very few results pertain …

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 …

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 …

The investigation of a software system prior to a modification task often constitutes an
important fraction of the overall effort associated with the task. We present Suade, an Eclipse …

abstract The Cops and Robbers game is played on undirected graphs where a group of
cops tries to catch a robber. The game was defined independently by Winkler-Nowakowski …

In this paper we consider the problem of capturing an intruder in a networked environment.
The intruder is defined as a mobile entity that moves inside the network and escapes from a …

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 …

In this paper we consider the problem of searching for an intruder in a network. There is a
team of collaborative software agents that are deployed to capture a hostile intruder (eg, a …

It is proven that the connected pathwidth of any graph G is at most 2⋅pw(G)+1, where pw(G)
is the pathwidth of G. The method is constructive, ie, it yields an efficient algorithm that for a …