The complexity of pursuit on a graph (Q673639)
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 985677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of pursuit on a graph |
scientific article; zbMATH DE number 985677 |
Statements
The complexity of pursuit on a graph (English)
0 references
28 February 1997
0 references
PSPACE completeness
0 references
EXPTIME-completeness
0 references
0.9080703854560852
0 references
0.8942798376083374
0 references
0.8795431852340698
0 references
0.8784133791923523
0 references
0.8698265552520752
0 references
