A note on parallel complexity of maximum \(f\)-matching (Q293199): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:10, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on parallel complexity of maximum \(f\)-matching |
scientific article |
Statements
A note on parallel complexity of maximum \(f\)-matching (English)
0 references
9 June 2016
0 references
parallel algorithms
0 references
maximum matching
0 references
