Searching for mobile intruders in circular corridors by two 1-searchers (Q643019)
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 5964717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Searching for mobile intruders in circular corridors by two 1-searchers |
scientific article; zbMATH DE number 5964717 |
Statements
Searching for mobile intruders in circular corridors by two 1-searchers (English)
0 references
27 October 2011
0 references
computational geometry
0 references
visibility
0 references
polygon search problem
0 references
1-searchers
0 references
deadlocks
0 references
0.953907072544098
0 references
0.8643765449523926
0 references
0.8569221496582031
0 references
0.8358842134475708
0 references
