Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334)
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: Minimum fill-in and treewidth of split + ke and split +kv graphs |
scientific article; zbMATH DE number 5711866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs |
scientific article; zbMATH DE number 5711866 |
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
0 references
0 references
0.9932626485824584
0 references
0.7677120566368103
0 references
0.758292019367218
0 references
0.7568764090538025
0 references
