Efficient Algorithms for Layer Assignment Problem
- 1 January 1987
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 6 (1) , 67-78
- https://doi.org/10.1109/tcad.1987.1270247
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An Unconstrained Topological Via Minimization Problem for Two-Layer RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- Optimal Wiring of Movable TerminalsIEEE Transactions on Computers, 1983
- A graph-theoretic via minimization algorithm for two-layer printed circuit boardsIEEE Transactions on Circuits and Systems, 1983
- Efficient Algorithms for Channel RoutingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- Number of Vias: A Control Parameter for Global Wiring of High-Density ChipsIBM Journal of Research and Development, 1981
- An Optimum Layer Assignment for Routing in ICs and PCBsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A shortest path algorithm for grid graphsNetworks, 1977
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Wire routing by optimizing channel assignment within large aperturesPublished by Association for Computing Machinery (ACM) ,1971
- An algorithm for finding a fundamental set of cycles of a graphCommunications of the ACM, 1969