A note on parallel complexity of maximum \(f\)-matching (Q293199): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6590672 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parallel algorithms | |||
| Property / zbMATH Keywords: parallel algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximum matching | |||
| Property / zbMATH Keywords: maximum matching / rank | |||
Normal rank | |||
Revision as of 20:15, 27 June 2023
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
