Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460)

From MaRDI portal
Revision as of 22:53, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    27 November 2012
    0 references
    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