Skip to Main content Skip to Navigation

Report on GRASTA 2014

Fedor Fomin 1 Pierre Fraigniaud 2 Nicolas Nisse 3, 4 Dimitrios M. Thilikos 5, 6
3 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
6 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download
Contributor : Dimitrios Thilikos <>
Submitted on : Tuesday, November 18, 2014 - 5:35:25 PM
Last modification on : Tuesday, June 30, 2020 - 3:34:02 PM
Document(s) archivé(s) le : Friday, April 14, 2017 - 7:55:20 PM


report on GRASTA 2014.pdf
Files produced by the author(s)


  • HAL Id : hal-01084230, version 1


Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. Report on GRASTA 2014. [Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014. ⟨hal-01084230⟩



Record views


Files downloads