Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5561160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover |
scientific article; zbMATH DE number 5561160 |
Statements
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (English)
0 references
3 June 2009
0 references
0.9903399
0 references
0.9462024
0 references
0.9462024
0 references
0.92728215
0 references
0.9109263
0 references
0.90808094
0 references
0.90808094
0 references
0.9061534
0 references
