The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree (Q3651570): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:20, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree |
scientific article |
Statements
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree (English)
0 references
11 December 2009
0 references
almost perfect matchings
0 references
polynomial time algorithm
0 references
