Unique Maximum Matching Algorithms (Q2746432)

From MaRDI portal
Revision as of 22:48, 19 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q598808)
scientific article
Language Label Description Also known as
English
Unique Maximum Matching Algorithms
scientific article

    Statements

    title
    Unique Maximum Matching Algorithms (English)
    0 references
    author
    Harold N. Gabow
    0 references
    Haim Kaplan
    0 references
    publication date
    8 April 2002
    0 references
    zbMATH Keywords
    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

    Mathematics Subject Classification ID
    05C85
    0 references
    05C70
    0 references
    68W05
    0 references
    68R10
    0 references
    zbMATH DE Number
    1656028
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2746432&oldid=21690124"
    Powered by MediaWiki