Via assignment problem in multilayer printed circuit board
- 1 April 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems
- Vol. 26 (4), 261-272
- https://doi.org/10.1109/tcs.1979.1084634
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Computational Complexity of Combinatorial and Graph-Theoretic ProblemsPublished by Springer Nature ,2011
- Suboptimum solution of the back-board ordering with channel capacity constraintIEEE Transactions on Circuits and Systems, 1977
- The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer caseIEEE Transactions on Circuits and Systems, 1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Approximation algorithms for combinatorial problemsPublished by Association for Computing Machinery (ACM) ,1973
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- A note on two problems in connexion with graphsNumerische Mathematik, 1959