In the graph exploration problem, a team of mobile computational entities, called agents,
arbitrarily positioned at some nodes of a graph, must cooperate so that each node is …

Moving and Computing Models: Robots | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

Current mobile agent algorithms for map** faults in computer networks assume that the
network is static. However, for large classes of highly dynamic networks (eg, wireless mobile …

The aim of the present study was to develop a rapid and simple method for the detection and
quantification of antibiotic and antibacterial residues in honey using liquid chromatography …

A black hole is a highly harmful stationary process residing in a node of a network and
destroying all mobile agents visiting the node without leaving any trace. The Black Hole …

In this paper, we start the investigation of distributed computing by mobile agents in
dangerous dynamic networks. The danger is posed by the presence in the network of a …

Almost all the vast literature on graph exploration assumes that the graph is static: its
topology does not change during the exploration, except for occasional faults. To date, very …

Consider a team of (one or more) mobile agents operating in a graph G. Unaware of the
graph topology and starting from the same node, the team must explore the graph. This …

We consider the problem of locating a black hole in synchronous anonymous networks
using finite state agents. A black hole is a harmful node in the network that destroys any …

A black hole is a highly harmful stationary process residing in a node of a network and
destroying all mobile agents visiting the node without leaving any trace. The Black Hole …