An optimal parallel circle-cover algorithm

https://doi.org/10.1016/0020-0190(89)90060-4Get rights and content

Abstract

Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with O(n2) processors and uses O(n2) space.

References (5)

There are more references available in the full text version of this article.

Cited by (0)

View full text