Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition (Q2934329)

From MaRDI portal
Revision as of 22:42, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition
scientific article

    Statements

    Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition (English)
    0 references
    0 references
    0 references
    12 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    arboricity
    0 references
    coloring
    0 references
    forests decomposition
    0 references
    MIS
    0 references
    \textsc{Maximal Independent Set}
    0 references
    0 references