A note on parallel complexity of maximum \(f\)-matching (Q293199)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on parallel complexity of maximum f-matching |
scientific article; zbMATH DE number 6590672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on parallel complexity of maximum \(f\)-matching |
scientific article; zbMATH DE number 6590672 |
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
