Sciweavers

Share
9 search results - page 1 / 2
» Searching for a Black Hole in Tree Networks
Sort
View
OPODIS
2004
9 years 7 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...
NETWORKS
2008
9 years 5 months ago
Approximation bounds for Black Hole Search problems
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab...
SIROCCO
2004
9 years 7 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
NETWORKS
2006
9 years 5 months ago
Black hole search in common interconnection networks
Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...
books