Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2012.01.025 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.01.025 / rank | |||
Normal rank | |||
Revision as of 07:07, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
