DagRep.1.2.30.pdf
- Filesize: 0.84 MB
- 17 pages
Document
Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 1, Issue 2
Volume: Dagstuhl Reports, Volume 1
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-06-27
Cite AsGet BibTex
Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, and Dimitrios M. Thilikos. Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071). In Dagstuhl Reports, Volume 1, Issue 2, pp. 30-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/DagRep.1.2.30
https://doi.org/10.4230/DagRep.1.2.30
Abstract
From February 14, 2012 to February 18, 2012, the Dagstuhl Seminar 11071
``Theory and Applications of Graph Searching Problems (GRASTA 2011)''
was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and open problems are put together in this paper. The first section describes the seminar topics and goals in general.
The second section contains the abstracts of the talks and the third section
includes the open problems presented during the seminar.
Keywords
- Graph Searching
- Pursuit Evasion Games
- Cop and Robers Games
- Fugitive Search Games
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads