Sciweavers

Share
12 search results - page 1 / 3
» Time Optimal Algorithms for Black Hole Search in Rings
Sort
View
COCOA
2010
Springer
11 years 9 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
SIROCCO
2004
12 years 1 months ago
Improved Bounds for Optimal Black Hole Search with a Network Map
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
Stefan Dobrev, Paola Flocchini, Nicola Santoro
OPODIS
2004
12 years 1 months ago
Searching for a Black Hole in Tree Networks
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. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
WDAG
2001
Springer
91views Algorithms» more  WDAG 2001»
12 years 4 months ago
Mobile Search for a Black Hole in an Anonymous Ring
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
OPODIS
2003
12 years 1 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
books