Computational complexity of the perfect matching problem in hypergraphs with subcritical density (Q3069732)
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 5838912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the perfect matching problem in hypergraphs with subcritical density |
scientific article; zbMATH DE number 5838912 |
Statements
COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (English)
0 references
19 January 2011
0 references
hypergraph
0 references
perfect matching
0 references
complexity
0 references
0.979177951812744
0 references
0.8879859447479248
0 references
0.8775856494903564
0 references
0.8775433301925659
0 references
0.8750104308128357
0 references
