Nondeterministic graph searching: from pathwidth to treewidth (Q1024783)
From MaRDI portal
!
WARNING
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 5566004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondeterministic graph searching: from pathwidth to treewidth |
scientific article; zbMATH DE number 5566004 |
Statements
Nondeterministic graph searching: from pathwidth to treewidth (English)
0 references
17 June 2009
0 references
treewidth
0 references
pathwidth
0 references
graph searching
0 references
0.999070167541504
0 references
0.8766914010047913
0 references
0.7579545378684998
0 references
