The price of connectivity for dominating set: upper bounds and complexity (Q406321)

From MaRDI portal
Revision as of 01:08, 9 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
The price of connectivity for dominating set: upper bounds and complexity
scientific article

    Statements

    The price of connectivity for dominating set: upper bounds and complexity (English)
    0 references
    0 references
    0 references
    8 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    domination
    0 references
    connected domination
    0 references
    forbidden induced subgraphs
    0 references
    computational complexity
    0 references
    0 references
    0 references