Computing hypergraph width measures exactly (Q437685)
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: Computing hypergraph width measures exactly |
scientific article; zbMATH DE number 6058202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing hypergraph width measures exactly |
scientific article; zbMATH DE number 6058202 |
Statements
Computing hypergraph width measures exactly (English)
0 references
18 July 2012
0 references
design of algorithms
0 references
graph algorithms
0 references
generalized hypertree-width
0 references
fractional hypertree-width
0 references
exact exponential algorithms
0 references
0 references
0.88650894
0 references
0.88399947
0 references
0.8644098
0 references
0.85828173
0 references
0.8542892
0 references
0.8535477
0 references
0.8484694
0 references
0.8481894
0 references
0.8480082
0 references
