Polynomial-time perfect matchings in dense hypergraphs (Q475264)
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 6374148
| 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 6374148 |
Statements
Polynomial-time perfect matchings in dense hypergraphs (English)
0 references
26 November 2014
0 references
hypergraphs
0 references
algorithms
0 references
matchings
0 references
0 references
0 references
0.9952029585838318
0 references
0.8965525031089783
0 references
0.8801162242889404
0 references
0.8781426548957825
0 references
0.874291181564331
0 references
