The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree (Q3651570): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_43 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1838065876 / rank
 
Normal rank

Latest revision as of 00:40, 20 March 2024

scientific article
Language Label Description Also known as
English
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree
scientific article

    Statements

    The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree (English)
    0 references
    0 references
    11 December 2009
    0 references
    almost perfect matchings
    0 references
    polynomial time algorithm
    0 references

    Identifiers