A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330)

From MaRDI portal
Revision as of 17:13, 23 August 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
A log-star distributed maximal independent set algorithm for growth-bounded graphs
scientific article

    Statements

    A log-star distributed maximal independent set algorithm for growth-bounded graphs (English)
    0 references
    12 December 2014
    0 references
    ad hoc networks
    0 references
    coloring
    0 references
    \textsc{Connected Dominating Sets}
    0 references
    dominating sets
    0 references
    growth bounded graphs
    0 references
    local algorithms
    0 references
    \textsc{Maximal Independent Set}
    0 references
    parallel algorithms
    0 references
    radio networks
    0 references
    sensor networks
    0 references
    symmetry breaking
    0 references
    unit disk graphs
    0 references

    Identifiers

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