Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643)
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: Finding a minimal cover for binary images: An optimal parallel algorithm |
scientific article; zbMATH DE number 14308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a minimal cover for binary images: An optimal parallel algorithm |
scientific article; zbMATH DE number 14308 |
Statements
Finding a minimal cover for binary images: An optimal parallel algorithm (English)
0 references
25 June 1992
0 references
minimum square cover
0 references
EREW-PRAM
0 references
image compression
0 references
orthogonal polygons
0 references
parallel prefix computations
0 references
minimal vertex covers
0 references
bipartite graphs
0 references
0 references
0.86021876
0 references
0.8590282
0 references
0.85857046
0 references
0.85741806
0 references
0.85432696
0 references
0.85222876
0 references
0.8511511
0 references
