An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (Q750155)
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: An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon |
scientific article; zbMATH DE number 4174328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon |
scientific article; zbMATH DE number 4174328 |
Statements
An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon (English)
0 references
1991
0 references
optimization
0 references
parallel algorithm
0 references
convex polygon
0 references
0.8899782299995422
0 references
0.8875669836997986
0 references
0.8579970002174377
0 references
0.8519480228424072
0 references
0.788318932056427
0 references
