Layouts with wires of balanced length (Q1091358)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Layouts with wires of balanced length |
scientific article; zbMATH DE number 4010405
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Layouts with wires of balanced length |
scientific article; zbMATH DE number 4010405 |
Statements
Layouts with wires of balanced length (English)
0 references
1987
0 references
The authors investigate the optimal balanced layouts of the graphs with fixed boundaries in the Euclidean plane. It appears that the main justification for using ''the graph with fixed boundary'' is to model the abstract structure of a circuit together with topological constraints given by the boundary of the chip and fixed i/o-ports. The originality of the present paper lies in the rigorously established existence of a layout which minimizes the maximum distance of any node to its neighbors.
0 references
VLSI
0 references
circuits
0 references
geometrical algorithms
0 references
optimal balanced layouts
0 references
graphs with fixed boundaries
0 references
