Non-deterministic graph searching in trees (Q2344776)
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 6436219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-deterministic graph searching in trees |
scientific article; zbMATH DE number 6436219 |
Statements
Non-deterministic graph searching in trees (English)
0 references
18 May 2015
0 references
graph searching
0 references
treewidth
0 references
pathwidth
0 references
trees
0 references
0 references
0.881779134273529
0 references
0.8766914010047913
0 references
0.8102012872695923
0 references
0.8063489198684692
0 references
0.7900263071060181
0 references
