Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549)

From MaRDI portal
Revision as of 00:15, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
scientific article

    Statements

    Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (English)
    0 references
    0 references
    0 references
    1 July 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Computational complexity
    0 references
    graph algorithms
    0 references