Report on GRASTA 2014

Abstract : Graph searching involves a team of mobile agents (called searchers or pursuers or cops) that aims at cap- turing a set of escaping agents (called evaders or fugitives or robbers) that hide in a network modeled by a graph. There are many variants of graph searching studied in the literature, often referred to as a pursuit- evasion game or cops and robbers game. These variants are either application driven, i.e. motivated by problems in practice, or are inspired by foundational issues in Computer Science, Discrete Mathematics, and Artificial Intelligence. Thus many researchers from different areas of Mathematics, Computer Science and Operations Research are interested in quite similar problems around graph searching.
Type de document :
[Research Report] 6th Workshop on GRAph Searching, Theory and Applications. 2014
Contributeur : Dimitrios M. Thilikos <>
Soumis le : mardi 18 novembre 2014 - 17:35:25
Dernière modification le : mardi 11 octobre 2016 - 15:08:58


report on GRASTA 2014.pdf
Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01084230, version 1



Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. Report on GRASTA 2014. [Research Report] 6th Workshop on GRAph Searching, Theory and Applications. 2014. <hal-01084230>



Consultations de
la notice


Téléchargements du document