On the Distributed Complexity of Computing Maximal Matchings (Q2784500)

From MaRDI portal
Revision as of 20:02, 20 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q736604)
scientific article
Language Label Description Also known as
English
On the Distributed Complexity of Computing Maximal Matchings
scientific article

    Statements

    title
    On the Distributed Complexity of Computing Maximal Matchings (English)
    0 references
    author
    Michał Karoński
    0 references
    Alessandro Panconesi
    0 references
    publication date
    23 April 2002
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C85
    0 references
    68R10
    0 references
    68Q10
    0 references
    68Q25
    0 references
    zbMATH DE Number
    1732388
    0 references
    zbMATH Keywords
    graph algorithm
    0 references
    distributed algorithm
    0 references
    synchronous
    0 references
    deterministic
    0 references
    maximal matching
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2784500&oldid=21978686"
    Powered by MediaWiki