The complexity of zero-visibility cops and robber (Q897941)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6517474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of zero-visibility cops and robber |
scientific article; zbMATH DE number 6517474 |
Statements
The complexity of zero-visibility cops and robber (English)
0 references
8 December 2015
0 references
cops and robber
0 references
graph searching
0 references
tree
0 references
pursuit evasion
0 references
1.0000001
0 references
0.86340564
0 references
0.85063016
0 references
0.84844714
0 references
0.8424911
0 references
0.8360322
0 references
0.83579147
0 references
0 references
0.82796496
0 references
