On tradeoffs between width- and fill-like graph parameters (Q1999998)
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: On tradeoffs between width- and fill-like graph parameters |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On tradeoffs between width- and fill-like graph parameters |
scientific article |
Statements
On tradeoffs between width- and fill-like graph parameters (English)
0 references
27 June 2019
0 references
fill-in
0 references
graph searching
0 references
node search
0 references
pathwidth
0 references
profile
0 references
treewidth
0 references
