Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803)

From MaRDI portal
Revision as of 19:33, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Hardness results and approximation algorithm for total liar's domination in graphs
scientific article

    Statements

    Hardness results and approximation algorithm for total liar's domination in graphs (English)
    0 references
    0 references
    0 references
    24 June 2014
    0 references
    domination
    0 references
    liar's domination
    0 references
    chordal graph
    0 references
    graph algorithm
    0 references
    approximation algorithm
    0 references
    NP-completeness
    0 references
    APX-completeness
    0 references

    Identifiers