The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 03:29, 30 January 2024

scientific article
Language Label Description Also known as
English
The \(k\)-hop connected dominating set problem: hardness and polyhedra
scientific article

    Statements

    The \(k\)-hop connected dominating set problem: hardness and polyhedra (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2016
    0 references
    \(k\)-hop connected dominating set
    0 references
    hardness
    0 references
    polytope
    0 references
    facets
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references