Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:34, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs |
scientific article |
Statements
Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (English)
0 references
25 May 2010
0 references
split graphs
0 references
minimum fill-in
0 references
treewidth
0 references
parameterized algorithms
0 references
