-
Hardness and Approximation Results for Black Hole Search in Arbitrary 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. The... -
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring
International audience -
Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
Computing with mobile agents is rapidly becoming a topic of mainstream research in the theory of distributed computing. The main research questions undertaken in this... -
Complexity of dynamic graph exploration by a mobile agent
In this thesis, we study the complexity of the problem of exploration by a mobile agent in dynamic graphs. A mobile entity (called agent) moving in a dynamic graph has... -
AGNI : encore une plate-forme à agents mobiles !
Colloque avec actes et comité de lecture.
