PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON THE PRAM MODEL

DOI10.1142/S0218195993000245MaRDI QIDQ4289633zbMATH OpenFDO

Authors I. W. Chan, Donald K. Friesen

Publication date 3 May 1994

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

computational geometryparallel algorithmsEREW PRAMgeometric algorithmsdirect dominanceisothetic rectangles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Parallel algorithms for planar dominance counting
• scientific article; zbMATH DE number 1057777
• A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

Cited in

(5)

• A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
• Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
• Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
• Parallel data distribution management on shared-memory multiprocessors
• Parallel algorithms for planar dominance counting

This page was built for publication: PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON THE PRAM MODEL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4289633)