Finding all minimum-cost perfect matchings in Bipartite graphs (Q4014612)

From MaRDI portal
Revision as of 13:50, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Finding all minimum-cost perfect matchings in Bipartite graphs
scientific article

    Statements

    title
    Finding all minimum-cost perfect matchings in Bipartite graphs (English)
    0 references
    author
    Komei Fukuda
    0 references
    Tomomi Matsui
    0 references
    published in
    Networks
    0 references
    publication date
    13 October 1992
    0 references
    zbMATH Keywords
    Hungarian method
    0 references
    minimal-cost perfect matching
    0 references
    weighted bipartite graph
    0 references

    Identifiers

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