Computing hypergraph width measures exactly (Q437685): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing hypergraph width measures exactly |
scientific article |
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
