The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree (Q3651570): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_43 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1838065876 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:40, 20 March 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
