The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:26, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Perfect Matching Problems on Dense Hypergraphs |
scientific article |
Statements
The Complexity of Perfect Matching Problems on Dense Hypergraphs (English)
0 references
17 December 2009
0 references
