On the maximum cardinality search lower bound for treewidth (Q997060)
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 5173152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum cardinality search lower bound for treewidth |
scientific article; zbMATH DE number 5173152 |
Statements
On the maximum cardinality search lower bound for treewidth (English)
0 references
19 July 2007
0 references
maximum cardinality search
0 references
treewidth
0 references
lower bounds
0 references
planar graphs
0 references
graph algorithms
0 references
0.99999994
0 references
0.9770396
0 references
0.9141019
0 references
0.90303344
0 references
0.89987016
0 references
0 references
0.8967439
0 references
0.89617085
0 references
0 references
