|
|
|
Thèse:
Algorithms for Deterministic Parallel Graph Exploration
|
Date | 2014-06-13 14:30-16:00 |
Titre | Algorithms for Deterministic Parallel Graph Exploration |
Résumé | In this thesis we study the problem of parallel graph exploration using multiple synchronized mobile agents. Each mobile agent is an entity that can, independently of other agents, visit vertices of the graph and traverse its edges. The goal of the agents is to visit all vertices of the graph. We will study three different variants of the problem:
(i) Exploration with agents equipped with memory that are allowed to communicate with each other.
(ii) Exploration in the rotor-router model which can be seen as derandomization of the random walk.
(iii) Collision-free exploration where each agent has to visit all nodes of the graph without meeting other agents.
|
Lieu | Amphithéâtre LaBRI |
Laboratoire | |
Doctorant | Dominik Pajak |
Directeur de thèse | Ralf Klasing, Adrian Kosowski |
Langue | Anglais |
Aucun document lié à cet événement. RetourRetour à l'index
| |