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

DOI10.1007/978-3-319-49259-9_31zbMath1425.68324OpenAlexW2548594287MaRDI QIDQ2007918

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, Takahiro Yakami

Publication date: 22 November 2019

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

zbMATH Keywords

graph search problemanonymous graphasynchronous searcherpursuit and evasion in graphonline and distributed setting

Mathematics Subject Classification ID

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

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