Maximum matching in a convex bipartite graph (Q5574593)

From MaRDI portal
Revision as of 17:50, 29 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3291805
Language Label Description Also known as
English
Maximum matching in a convex bipartite graph
scientific article; zbMATH DE number 3291805

    Statements

    title
    Maximum matching in a convex bipartite graph (English)
    0 references
    author
    Fred Glover
    0 references
    publication date
    1967
    0 references
    zbMATH Keywords
    operations research
    0 references

    Identifiers

    zbMATH DE Number
    3291805
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5574593&oldid=10039460"
      Powered by MediaWiki