All maximal independent sets and dynamic dominance for sparse graphs (Q2930264)

From MaRDI portal
scientific article
Language Label Description Also known as
English
All maximal independent sets and dynamic dominance for sparse graphs
scientific article

    Statements

    All maximal independent sets and dynamic dominance for sparse graphs (English)
    0 references
    0 references
    18 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial enumeration
    0 references
    bounded degree graphs
    0 references
    dominating sets
    0 references
    dynamic graph algorithms
    0 references
    maximal independent sets
    0 references
    minor-closed graph families
    0 references
    reverse search
    0 references
    sparse graphs
    0 references
    0 references
    0 references
    0 references