Special Issue on “Theory and Applications of Graph Searching Problems”

✍ Scribed by Fedor V. Fomin; Pierre Fraigniaud; Stephan Kreutzer; Dimitrios M. Thilikos

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 142 KB
• Volume: 412
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(11)00295-7

✦ Synopsis

Call for Papers Special Issue on ''Theory and Applications of Graph Searching Problems'' Manuscripts are solicited for a special issue in the journal ''Theoretical Computer Science'' (TCS) on ''Theory and Applications of Graph Searching Problems''. This special issue will be dedicated to the 60th birthday of Lefteris M. Kirousis.

Graph searching is often referred to, in a more playful language, as a pursuit-evasion game. This is a kind of game where one part is a set of evaders, that hide in a graph representing a network, and the other part is a number pursuers, that move systematically in the graph. The game may vary significantly according to the capabilities of the evaders and the pursuers. The objective of the game is to capture the evaders in an optimal way, where the notion of optimality itself admits several interpretations. The area of Graph Searching has become a very active research area in theoretical computer science and discrete mathematics, with impact and applications in various domains.