A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (Q688835): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:26, 30 January 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
