Digraph decompositions and monotonicity in digraph searching (Q638540)
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: Digraph decompositions and monotonicity in digraph searching |
scientific article; zbMATH DE number 5947166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Digraph decompositions and monotonicity in digraph searching |
scientific article; zbMATH DE number 5947166 |
Statements
Digraph decompositions and monotonicity in digraph searching (English)
0 references
12 September 2011
0 references
directed path-width
0 references
directed tree-width
0 references
DAG-width
0 references
Kelly-width
0 references
entanglement
0 references
graph searching
0 references
cops and robber games
0 references
monotonicity
0 references
0.9659503698349
0 references
0.8338966965675354
0 references
0.8199448585510254
0 references
0.8195409774780273
0 references
0.8185112476348877
0 references
