A framework for solving VLSI graph layout problems (Q796306)
From MaRDI portal
!
WARNING
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 3864517
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A framework for solving VLSI graph layout problems |
scientific article; zbMATH DE number 3864517 |
Statements
A framework for solving VLSI graph layout problems (English)
0 references
1984
0 references
divide-and-conquer framework for VLSI graph layout
0 references
layout area
0 references
propagation delay
0 references
large networks of processors
0 references
faulty processors
0 references
graph partitioning heuristics
0 references
0.90699565
0 references
0.90421104
0 references
0.8938226
0 references
0.89004326
0 references
0.88462573
0 references
0 references
