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

From MaRDI portal
Revision as of 14:48, 11 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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