A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (Q688835): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3997942 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast algorithms for direct enclosures and direct dominances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On rectangular visibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hidden surface removal for rectangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hole Problems for Rectangles in the Plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3694703 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel Merge Sort / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel approximation algorithms for bin packing / rank | |||
Normal rank |
Latest revision as of 10:29, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallel algorithm to construct a dominance graph on nonoverlapping rectangles |
scientific article |
Statements
A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (English)
0 references
6 December 1993
0 references
dominance graph
0 references
constraint graph
0 references
compaction algorithms for VLSI circuits
0 references
divide and conquer
0 references
EREW PRAM
0 references