Optimal three-dimensional VLSI layouts

DOI10.1007/BF01744565zbMath0503.94029MaRDI QIDQ4739807

Franco P. Preparata

Publication date: 1983

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

networklayoutcube-connected-cyclesall-active-volume modeone- active-layer modesolid chip

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings ⋮ Optimal three-dimensional layouts of complete binary trees ⋮ Optimal three-dimensional layout of interconnection networks ⋮ Planar acyclic computation ⋮ Complexities of layouts in three-dimensional VLSI circuits ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ An asymptotically optimal layout for the shuffle-exchange graph

Cites Work

• Three-Dimensional VLSI
• Optimal Rearrangeable Multistage Connecting Networks
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Optimal three-dimensional VLSI layouts