Efficient enumeration of dominating sets for sparse graphs (Q1983139)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient enumeration of dominating sets for sparse graphs
scientific article

    Statements

    Efficient enumeration of dominating sets for sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 September 2021
    0 references
    enumeration algorithm
    0 references
    polynomial amortized time
    0 references
    dominating set
    0 references
    girth
    0 references
    degeneracy
    0 references
    0 references
    0 references

    Identifiers

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