Sequential and parallel algorithms for finding a maximum convex polygon (Q676573)
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: Sequential and parallel algorithms for finding a maximum convex polygon |
scientific article; zbMATH DE number 992685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sequential and parallel algorithms for finding a maximum convex polygon |
scientific article; zbMATH DE number 992685 |
Statements
Sequential and parallel algorithms for finding a maximum convex polygon (English)
0 references
8 September 1997
0 references
convex polygons
0 references
0.8503212332725525
0 references
