3 Result(s)
within
Chapter
Stefan Dobrev
Computer Science
-
Chapter and Conference Paper
Locating a Black Hole in an Un-oriented Ring Using Tokens: The Case of Scattered Agents
Black hole search in a ring network has been studied in a token model. It is known that locating the black hole in an anonymous ring using tokens is feasible, if the team of agents is initially co-located. When d...
-
Chapter and Conference Paper
Exploring an Unknown Graph to Locate a Black Hole Using Tokens
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 problem, known as graph exploration, was...
-
Chapter and Conference Paper
Optimal Broadcasting in Even Tori with Dynamic Faults
We consider a broadcasting problem in the n-dimensional k-ary even torus in the shouting communication mode, i.e. any node of a network can inform all its neighbours in one time step. In addition, during any time...
