Polynomial-time perfect matchings in dense hypergraphs (Q475264): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047917450 / rank
 
Normal rank

Revision as of 22:23, 19 March 2024

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
    hypergraphs
    0 references
    algorithms
    0 references
    matchings
    0 references

    Identifiers

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