Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847)
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: Parallel approximation algorithms for maximum weighted matching in general graphs |
scientific article; zbMATH DE number 6594139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel approximation algorithms for maximum weighted matching in general graphs |
scientific article; zbMATH DE number 6594139 |
Statements
Parallel approximation algorithms for maximum weighted matching in general graphs (English)
0 references
16 June 2016
0 references
graph algorithms
0 references
maximum weighted matching
0 references
approximation algorithms
0 references
parallel algorithms
0 references
0.9267467856407166
0 references
0.883428692817688
0 references
0.8830151557922363
0 references
0.8637688755989075
0 references
