Closeness centrality is an important concept in social network analysis. In a graph
representing a social network, closeness centrality measures how close a vertex is to all …

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 …

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 …

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 …

This paper discusses the likely evolution of commercial data managers over the next several
years. Topics to be covered include: Why SQL has become an intergalactic standard. Who …

Fraigniaud et al.[L. Blin, P. Fraigniaud, N. Nisse, S. Vial, Distributing chasing of network
intruders, in: 13th Colloquium on Structural Information and Communication Complexity …

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 …

Graph searching is one of the most popular tools for analyzing the chase for a powerful and
hostile software agent (called the “intruder”), by a set of software agents (called the …

In this paper we consider the problem of connected edge searching of weighted trees.
Barrière et al. claim in [L. Barrière, P. Flocchini, P. Fraigniaud, N. Santoro, Capture of an …