A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260)

From MaRDI portal
Revision as of 15:04, 10 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A linear time algorithm for maximum matchings in convex, bipartite graphs
scientific article

    Statements

    title
    A linear time algorithm for maximum matchings in convex, bipartite graphs (English)
    0 references
    author
    Julian Scott Yeomans
    0 references
    George Steiner
    0 references
    publication date
    25 November 1996
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68W10
    0 references
    zbMATH DE Number
    915158
    0 references
    zbMATH Keywords
    maximum matching
    0 references
    convex bipartite graph
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1921260&oldid=20449788"
    Powered by MediaWiki