A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

DOI10.1007/BF01421677MaRDI QIDQ688835zbMATH OpenFDO

Authors Alan P. Sprague

Publication date 6 December 1993

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01421677

zbMATH Keywords

EREW PRAMdivide and conquerconstraint graphcompaction algorithms for VLSI circuitsdominance graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• PARALLEL ALGORITHMS FOR SOME DOMINANCE PROBLEMS BASED ON THE PRAM MODEL
• scientific article; zbMATH DE number 219272
• An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
• An optimal speedup algorithm for the measure problem
• Parallel algorithms for planar dominance counting

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• Fast algorithms for direct enclosures and direct dominances
• Hidden surface removal for rectangles
• Hole Problems for Rectangles in the Plane
• On rectangular visibility
• Parallel Merge Sort
• Parallel approximation algorithms for bin packing

Cited in

(3)

• Area and perimeter computation of the union of a set of iso-rectangles in parallel
• On dynamic task scheduling for FPGA-based systems
• Parallel algorithms for planar dominance counting

This page was built for publication: A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

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