Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.11.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050314192 / rank | |||
Normal rank | |||
Revision as of 02:55, 20 March 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
