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

From MaRDI portal
Revision as of 04:33, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/tcs/Tassa12, #quickstatements; #temporary_batch_1731468600454)
(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
    zbMATH Keywords
    bipartite graphs
    0 references
    perfect matchings
    0 references
    maximum matchings
    0 references
    maximally-matchable edges
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C70
    0 references
    05C35
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6034859
    0 references
    Wikidata QID
    Q56341084
    0 references
    OpenAlex ID
    W1998124720
    0 references
    arXiv ID
    1107.4711
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q418005&oldid=37895321"
    Powered by MediaWiki