Finding all maximally-matchable edges in a bipartite graph (Q418005)

From MaRDI portal
Revision as of 11:45, 21 June 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
Finding all maximally-matchable edges in a bipartite graph
scientific article

    Statements

    title
    Finding all maximally-matchable edges in a bipartite graph (English)
    0 references
    author
    Tamir Tassa
    0 references
    publication date
    14 May 2012
    0 references

    Identifiers

     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q418005&oldid=480114"
      Powered by MediaWiki