Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647)

From MaRDI portal
Revision as of 14:15, 29 June 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
scientific article

    Statements

    Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references