A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (Q688835)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 438584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm to construct a dominance graph on nonoverlapping rectangles |
scientific article; zbMATH DE number 438584 |
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
0.8063051700592041
0 references
0.7755236625671387
0 references
0.7643821239471436
0 references
0.7618622779846191
0 references
