Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653)

From MaRDI portal
Revision as of 11:03, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
scientific article

    Statements

    Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    graph algorithms
    0 references
    efficient domination
    0 references
    weighted efficient domination
    0 references
    dually chordal graph
    0 references
    AT-free graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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