Searching for an evader in an unknown graph by an optimal number of searchers (Q2007918)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Searching for an evader in an unknown graph by an optimal number of searchers |
scientific article; zbMATH DE number 7135309
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Searching for an evader in an unknown graph by an optimal number of searchers |
scientific article; zbMATH DE number 7135309 |
Statements
Searching for an evader in an unknown graph by an optimal number of searchers (English)
0 references
22 November 2019
0 references
anonymous graph
0 references
asynchronous searcher
0 references
graph search problem
0 references
online and distributed setting
0 references
pursuit and evasion in graph
0 references
0 references
0 references
0.86830753
0 references
0.85645545
0 references
0.8492845
0 references
