The labeled perfect matching in bipartite graphs (Q1044711)

From MaRDI portal
Revision as of 14:47, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The labeled perfect matching in bipartite graphs
scientific article

    Statements

    title
    The labeled perfect matching in bipartite graphs (English)
    0 references
    publication date
    18 December 2009
    0 references
    zbMATH Keywords
    labeled matching
    0 references
    bipartite graphs
    0 references
    NP-complete
    0 references
    approximate algorithms
    0 references
    author
    Jérôme Monnot
    0 references

    Identifiers

    zbMATH DE Number
    5650135
    0 references
    OpenAlex ID
    W2090200648
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1044711&oldid=38599773"
    Powered by MediaWiki