Polynomial-time perfect matchings in dense hypergraphs (Q5495801)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-time perfect matchings in dense hypergraphs |
scientific article; zbMATH DE number 6326965
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time perfect matchings in dense hypergraphs |
scientific article; zbMATH DE number 6326965 |
Statements
Polynomial-time perfect matchings in dense hypergraphs (English)
0 references
7 August 2014
0 references
lattices
0 references
perfect matchings
0 references
0.9952029585838318
0 references
0.89500892162323
0 references
0.881798267364502
0 references
0.8816757202148438
0 references
0.8758115768432617
0 references
