Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659)

From MaRDI portal
Revision as of 04:45, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6442144
Language Label Description Also known as
English
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time
scientific article; zbMATH DE number 6442144

    Statements

    Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matching
    0 references
    dynamic graph algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references