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 basic primitive for a mobile agent is the ability to visit all the nodes of the graph in a
systematic manner. This chapter considers the exploration of unknown graphs in full detail …

Immunizing a subset of nodes in a network-enabling them to identify and withstand the
spread of harmful content-is one of the most effective ways to counter the spread of …

This paper studies the well-known problem of gathering multiple mobile agents moving in a
graph, but unlike previous results, we consider the problem in the presence of an …

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 …

Given a network of nodes, minimizing the spread of a contagion using a limited budget is a
well-studied problem with applications in network security, viral marketing, social networks …

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 …

Abstract We present Guaranteed Search with Spanning Trees (GSST), an anytime algorithm
for multi-robot search. The problem is as follows: clear the environment of any adversarial …

The problem of identifying important players in a given network is of pivotal importance for
viral marketing, public health management, network security and various other fields of …

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 …