The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249)

From MaRDI portal
Revision as of 08:10, 14 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q396628)
scientific article
Language Label Description Also known as
English
The Complexity of Perfect Matching Problems on Dense Hypergraphs
scientific article

    Statements

    The Complexity of Perfect Matching Problems on Dense Hypergraphs (English)
    0 references
    0 references
    0 references
    17 December 2009
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references