Monotony properties of connected visible graph searching (Q999260)
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: Monotony properties of connected visible graph searching |
scientific article; zbMATH DE number 5501943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monotony properties of connected visible graph searching |
scientific article; zbMATH DE number 5501943 |
Statements
Monotony properties of connected visible graph searching (English)
0 references
3 February 2009
0 references
graph searching
0 references
treewidth
0 references
pathwidth
0 references
0.9831511378288268
0 references
0.8185306787490845
0 references
0.8095560669898987
0 references
0.8046788573265076
0 references
