Polynomial-time perfect matchings in dense hypergraphs (Q475264)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial-time perfect matchings in dense hypergraphs
scientific article

    Statements

    Polynomial-time perfect matchings in dense hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    26 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hypergraphs
    0 references
    algorithms
    0 references
    matchings
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references