Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460)
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: Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy |
scientific article |
Statements
Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (English)
0 references
27 November 2012
0 references
parameterized complexity
0 references
multiple-interval graphs
0 references
domination
0 references
\(k\)-dominating set
0 references
\(d\)-distance \(k\)-dominating set
0 references
hardness
0 references
completeness
0 references
partition
0 references
separation
0 references
separating vertices
0 references
irredundant set
0 references
0 references
0 references
0.9576683044433594
0 references
0.8920400738716125
0 references
0.8903164863586426
0 references
0.8360399007797241
0 references
