Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (Q387819)

From MaRDI portal
Revision as of 04:40, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Addendum to ``Finding all maximally-matchable edges in a bipartite graph''
scientific article

    Statements

    title
    Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (English)
    0 references
    author
    Tamir Tassa
    0 references
    publication date
    17 December 2013
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C35
    0 references
    05C85
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6238870
    0 references
    zbMATH Keywords
    bipartite graphs
    0 references
    perfect matchings
    0 references
    maximum matchings
    0 references
    maximally-matchable edges
    0 references
    OpenAlex ID
    W2065389185
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q387819&oldid=35365381"
    Powered by MediaWiki