Global wire routing in two-dimensional arrays
- 1 November 1987
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 2 (1-4) , 113-129
- https://doi.org/10.1007/bf01840353
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Optimal VLSI graph embeddings in variable aspect ratio rectanglesAlgorithmica, 1988
- A decomposition algorithm for circuit routingPublished by Springer Nature ,1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Global wire routing in two-dimensional arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Hierarchical Wire RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Wire-routing machines—New tools for VLSI physical designProceedings of the IEEE, 1983
- The NP-completeness column: An ongoing guldeJournal of Algorithms, 1982
- New lower bound techniques for VLSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- “Integer-making” theoremsDiscrete Applied Mathematics, 1981
- Two-dimensional stochastic model for interconnections in master slice integrated circuitsIEEE Transactions on Circuits and Systems, 1981