A parallel algorithm to construct a dominance graph on nonoverlapping rectangles

DOI10.1007/BF01421677zbMath0784.68036MaRDI QIDQ688835

Alan P. Sprague

Publication date: 6 December 1993

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

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)

Related Items (1)

ON DYNAMIC TASK SCHEDULING FOR FPGA-BASED SYSTEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Hidden surface removal for rectangles
• Parallel approximation algorithms for bin packing
• Hole Problems for Rectangles in the Plane
• On rectangular visibility
• Parallel Merge Sort
• Fast algorithms for direct enclosures and direct dominances

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