The complexity of searching a graph (Q3777477)
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: The complexity of searching a graph |
scientific article; zbMATH DE number 4039323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of searching a graph |
scientific article; zbMATH DE number 4039323 |
Statements
The complexity of searching a graph (English)
0 references
1988
0 references
NP-completeness
0 references
pursuit and evasion
0 references
graph algorithms
0 references
searching. search number
0 references
0.9366863
0 references
0.9178857
0 references
0.9170495
0 references
0 references
0.90826666
0 references
