Polynomial-time perfect matchings in dense hypergraphs (Q475264): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AIM.2014.10.009 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AIM.2014.10.009 / rank | |||
Normal rank | |||
Latest revision as of 18:34, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time perfect matchings in dense hypergraphs |
scientific article |
Statements
Polynomial-time perfect matchings in dense hypergraphs (English)
0 references
26 November 2014
0 references
hypergraphs
0 references
algorithms
0 references
matchings
0 references
0 references
0 references
