An optimal maximal independent set algorithm for bounded-independence graphs (Q992507)

From MaRDI portal
Revision as of 01:51, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An optimal maximal independent set algorithm for bounded-independence graphs
scientific article

    Statements

    An optimal maximal independent set algorithm for bounded-independence graphs (English)
    0 references
    0 references
    9 September 2010
    0 references
    ad hoc network
    0 references
    sensor network
    0 references
    radio network
    0 references
    unit disk graph
    0 references
    growth bounded graph
    0 references
    bounded-independence graph
    0 references
    local algorithm
    0 references
    parallel algorithm
    0 references
    maximal independent set
    0 references
    maximal matching
    0 references
    dominating set
    0 references
    connected dominating set
    0 references
    coloring
    0 references
    symmetry breaking
    0 references

    Identifiers

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