Complexity of distance paired-domination problem in graphs (Q1758170)

From MaRDI portal
Revision as of 05:35, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Complexity of distance paired-domination problem in graphs
scientific article

    Statements

    Complexity of distance paired-domination problem in graphs (English)
    0 references
    0 references
    8 November 2012
    0 references
    distance \(k\)-dominating set
    0 references
    distance \(k\)-paired-dominating set
    0 references
    strongly chordal graph
    0 references
    undirected path graph
    0 references
    NP-complete
    0 references
    approximation algorithm
    0 references
    APX-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references