Optimal overlap representations

  • Authors:

  • Affiliations:

  • Venue:
  • ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we investigate the problem of computing minimal interval and circular arc overlap representations, and give several optimal algorithms. We show that, among other things, given an s/spl times/t interval or circular arc overlap representation matrix: a minimal interval overlap representation can be obtained with O(log(st)) time with O(st/log(st)) EREW PRAM processors, or in O(log t/log log t) time with O(st log log t/log t) common CRCW PRAM processors, or in O(1) time with O(st) BSR processors; a minimal circular arc overlap representation can be obtained in O(st) time.