Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530)
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 dark cave by an optimal number of asynchronous searchers |
scientific article; zbMATH DE number 7401206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers |
scientific article; zbMATH DE number 7401206 |
Statements
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (English)
0 references
27 September 2021
0 references
anonymous graph
0 references
asynchronous searcher
0 references
dark cave model
0 references
graph search problem
0 references
pursuit and evasion in graph
0 references
0.8602697849273682
0 references
0.7406993508338928
0 references
0.740047037601471
0 references
0.7389420866966248
0 references
0.7359853386878967
0 references
