Unique Maximum Matching Algorithms (Q2746432)

From MaRDI portal
Revision as of 01:28, 16 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Unique Maximum Matching Algorithms
scientific article

    Statements

    Unique Maximum Matching Algorithms (English)
    0 references
    0 references
    0 references
    0 references
    8 April 2002
    0 references
    maximum matchings
    0 references
    perfect matching
    0 references
    dynamic connectivity algorithm
    0 references
    planar graphs
    0 references
    blossom-shrinking algorithm
    0 references
    depth-first search
    0 references
    Kotzig's theorem
    0 references
    \(f\)-factor
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references