Graph theoretic algorithms for the PLA folding problem
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 8 (9) , 1014-1021
- https://doi.org/10.1109/43.35554
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- A Best-First Search Algorithm for Optimal PLA FoldingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- Bipartite Folding and Partitioning of a PLAIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1984
- Multiple Constrained Folding of Programmable Logic Arrays: Theory and ApplicationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Lower bounds on the independence number in terms of the degreesJournal of Combinatorial Theory, Series B, 1983
- An Algorithm for Optimal PLA FoldingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1982
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- An Introduction to Array LogicIBM Journal of Research and Development, 1975