Hierarchical Loose Routing for Gate Arrays
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 6 (5), 810-819
- https://doi.org/10.1109/tcad.1987.1270324
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Shortest‐path methods: Complexity, interrelations and new propositionsNetworks, 1984
- Computational study of an improved shortest path algorithmNetworks, 1984
- Global Wiring by Simulated AnnealingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Hierarchical Wire RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- A New Global Router for Gate Array LSIsiIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Routing Techniques for Gate ArrayIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Efficient Algorithms for Channel RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- A “greedy” channel routerPublished by Association for Computing Machinery (ACM) ,1982