Searching for an evader in an unknown graph by an optimal number of searchers

DOI10.1007/978-3-319-49259-9_31MaRDI QIDQ2007918zbMATH OpenOpenAlexFDO

Authors Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

Publication date 22 November 2019

Full work available at URL https://doi.org/10.1007/978-3-319-49259-9_31

zbMATH Keywords

anonymous graphasynchronous searchergraph search problemonline and distributed settingpursuit and evasion in graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Recommendations

• scientific article; zbMATH DE number 1151792
• Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
• Randomized Pursuit-Evasion in Graphs
• scientific article; zbMATH DE number 2086681
• On the optimality of a simple strategy for searching graphs
• Searching for an intruder on graphs and their subdivisions
• Complexity of searching an immobile hider in a graph
• scientific article; zbMATH DE number 10606

Cited in

(11)

• Graph searching with advice
• Efficiently searching a graph by a smell-oriented vertex process
• Complexity of searching an immobile hider in a graph
• Distributed graph searching with a sense of direction
• The cost of monotonicity in distributed graph searching
• Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
• On-line search in two-dimensional environment
• On-line search in two-dimensional environment
• Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
• Distributed chasing of network intruders
• Escaping offline searchers and isoperimetric theorems

This page was built for publication: Searching for an evader in an unknown graph by an optimal number of searchers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007918)