Monotonicity of strong searching on digraphs (Q2426650)
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 5266852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotonicity of strong searching on digraphs |
scientific article; zbMATH DE number 5266852 |
Statements
Monotonicity of strong searching on digraphs (English)
0 references
23 April 2008
0 references
Graph searching
0 references
Cops-and-robber game
0 references
Pursuit-and-evasion problem
0 references
Digraph
0 references
Monotonicity
0 references
NP-complete
0 references
0.9797088
0 references
0.9467781
0 references
0.93099284
0 references
0.93099284
0 references
0.92307043
0 references
0.92307043
0 references
0 references
0.92256665
0 references
0 references
