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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1016/j.endm.2015.07.011 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2015.07.011 / rank
 
Normal rank

Revision as of 23:54, 8 December 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
    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
    0 references