Simple Deterministic Algorithms for Fully Dynamic Maximal Matching (Q4962204)

From MaRDI portal
Revision as of 16:09, 2 May 2024 by EloiFerrer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
No description defined
Language Label Description Also known as
English
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
No description defined

    Statements

    title
    Simple Deterministic Algorithms for Fully Dynamic Maximal Matching (English)
    0 references
    DOI
    10.1145/2700206
    0 references
    author
    Ofer Neiman
    0 references
    Shay Solomon
    0 references
    publication date
    30 October 2018
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    05C70
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6968333
    0 references
    zbMATH Keywords
    dynamic algorithms
    0 references
    maximal matching
    0 references
    maximum matching
    0 references
    OpenAlex ID
    W2244920958
    0 references
    arXiv ID
    1207.1277
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4962204&oldid=34061958"
    Powered by MediaWiki