Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help.

Nicolas Nisse 1
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This manuscript describes the work I did since I obtained my Ph.D. in 2007. In addition to the presentation of my contributions, I tried to give overviews of the scienti c areas my work takes part of and some of the main issues that arise here. My work deals with new algorithmic challenges posed by the growth of nowadays networks and by the increased data and traffi c arising in it. One way to cope with the size of these problems is to use the particular network structures. For this, I strive to develop new characterizations of graph structural properties in order to calculate and use them e fficiently for an algorithmic perspective. Whenever possible, I propose distributed algorithms that are based only on a local/partial knowledge of networks. In particular, I study the Pursuit-Evasion games - dealing with the capture of a mobile entity by a team of other agents - that off er an interesting perspective on many properties of graphs and, in particular, decompositions of graphs. This approach from mobile agents point of view also allows the study of various applications in telecommunication networks and of some distributed computing models. Chapter 1 is dedicated to the study of several variants of turn-by-turn Pursuit-Evasion Games, mostly to the Cops and Robber games. Chapter 2 focuses on graph decompositions and their relationship with graph searching. Chapter 3 treats another aspect of Pursuit-Evasion games with a study of variants of Graph Searching games, both in centralized and distributed settings. Finally, Chapter 4 deals with routing problems in various environments and with distributed models of computation.
Complete list of metadatas

https://tel.archives-ouvertes.fr/tel-00998854
Contributor : Nicolas Nisse <>
Submitted on : Monday, June 2, 2014 - 6:58:34 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Tuesday, September 2, 2014 - 12:56:10 PM

Identifiers

  • HAL Id : tel-00998854, version 1

Collections

Citation

Nicolas Nisse. Algorithmic complexity: Between Structure and Knowledge How Pursuit-evasion Games help.. Data Structures and Algorithms [cs.DS]. Université Nice Sophia Antipolis, 2014. ⟨tel-00998854⟩

Share

Metrics

Record views

621

Files downloads

761