On the parameterized complexity of multiple-interval graph problems (Q1001898)
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 5509588
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of multiple-interval graph problems |
scientific article; zbMATH DE number 5509588 |
Statements
On the parameterized complexity of multiple-interval graph problems (English)
0 references
19 February 2009
0 references
multiple intervals
0 references
independent set
0 references
dominating set
0 references
clique
0 references
W-hardness
0 references
parameterized complexity
0 references
multicolored clique
0 references
0 references
0 references
0 references
0.8903164863586426
0 references
0.8786126971244812
0 references
0.8642765879631042
0 references
0.8603491187095642
0 references
0.8591299653053284
0 references
