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 …

Abstract Blin et al.(Theor Comput Sci 399 (1–2): 12–37, 2008) proposed a distributed
protocol enabling the smallest possible number of searchers to clear any unknown graph in …

In the online case, there is no knowledge of the evolution sequence, and the game might go
on forever. Also, each generated instance is required to be connected. We provide a nearly …

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 work, we study the problem of clearing contamination spreading through a large
network where we model the problem as a graph searching game. The problem can be …

Among the severe security threats faced in distributed mobile computing environments, two
are particularly troublesome: harmful agent and harmful host. This chapter consider security …

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 decontaminating a network from a black virus (BV)
using a team of mobile system agents. The BV is a harmful process which, like the …

Consider a tree network that has been contaminated by a persistent and active virus: when
infected, a network site will continuously attempt to spread the virus to all its neighbours. The …

Network decontamination is studied on a k-dimensional torus (n 1 times ldrldrldr times nk),
with k ges 1 and 2 les n 1 lesldrldrldrles n k. The decontamination is done by a set of agents …