On a hypergraph matching problem (Q2494110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5033611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a hypergraph matching problem |
scientific article; zbMATH DE number 5033611 |
Statements
On a hypergraph matching problem (English)
0 references
16 June 2006
0 references
\(r\)-uniform hypergraph
0 references
perfect matching
0 references
0.8694309592247009
0 references
0.8618778586387634
0 references
0.8583517074584961
0 references
0.8561898469924927
0 references
0.8502750396728516
0 references
