Polynomial-time perfect matchings in dense hypergraphs (Q475264): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:46, 30 January 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
