Polynomial-time perfect matchings in dense hypergraphs (Q475264)

From MaRDI portal
Revision as of 18:34, 9 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
Polynomial-time perfect matchings in dense hypergraphs
scientific article

    Statements

    title
    Polynomial-time perfect matchings in dense hypergraphs (English)
    0 references
    author
    Peter Keevash
    0 references
    Fiachra Knox
    0 references
    Richard Mycroft
    0 references
    publication date
    26 November 2014
    0 references
    zbMATH Keywords
    hypergraphs
    0 references
    algorithms
    0 references
    matchings
    0 references
    cites work
    Q4063504
    0 references
    Q4519896
    0 references
    Q3078214
    0 references
    Q2755077
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C70
    0 references
    05C65
    0 references
    05C42
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6374148
    0 references
    OpenAlex ID
    W2047917450
    0 references
    arXiv ID
    1307.2608
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q475264&oldid=38363266"
    Powered by MediaWiki