The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57255182, #quickstatements; #temporary_batch_1714653054045 |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Marek Karpinski / rank | |||
| Property / author | |||
| Property / author: Marek Karpinski / rank | |||
Normal rank | |||
| 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-10631-6_64 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1603859152 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57255182 / rank | |||
Normal rank | |||
Latest revision as of 14:36, 2 May 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
