Optimal VLSI graph embeddings in variable aspect ratio rectangles
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4) , 487-510
- https://doi.org/10.1007/bf01762128
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On driving many long wires in a VLSI layoutJournal of the ACM, 1986
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- New lower bound techniques for VLSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Universality considerations in VLSI circuitsIEEE Transactions on Computers, 1981
- Bounds on minimax edge length for complete binary treesPublished by Association for Computing Machinery (ACM) ,1981
- A Critique and an Appraisal of VLSI Models of ComputationPublished by Springer Nature ,1981
- On the area of binary tree layoutsInformation Processing Letters, 1980