Graph theoretic algorithms for the PLA folding problem

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 8, Issue 9, 1989, Pages 1014-1021

  Lecky, John E ^a   Murphy, Owen J ^a   Absher, Richard G ^a  

^a UNIVERSITY OF VERMONT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--GRAPH THEORY;

BIPARTITE FOLDING; CLIQUE IDENTIFICATION; CONSTRAINED FOLDING; GREEDY HEURISTIC; PLA FOLDING PROBLEM; PROGRAMMABLE LOGIC ARRAYS;

LOGIC DESIGN;

EID: 0024735683     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.35554     Document Type: Article

References (14)

1. E. Balas and C.S. Yu, “Finding a maximum clique in an arbitrary graph,” SIAM J. Comput., vol. 15, pp. 1054–1068, 1986.
2. B. Bollobas, Random Graphs. New York: Academic, 1985.
3. G. DeMicheli and A. Sangiovanni-Vincentelli, “Multiple constrained folding of programmable logic arrays: Theory and applications,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 151–167, July 1983.
4. J.R. Egan and C.L. Liu, “Bipartite Folding and Partitioning of a PLA,” IEEE Trans. Computer-Aided Design, vol. CAD-3, pp. 191–199, July 1984.
5. H. Fleisher and L.I. Maissel, “An introduction to array logic,” IBM J. Res. Develop., pp. 98–109, Mar. 1975.
6. M.R. Garey and D.S. Johnson, Computers and Intractability. San Francisco, CA: Freeman, 1979.
7. J.R. Griggs. “Lower bounds on the independence number in terms of degrees,” J. Combinatorial Theory, Series B, no. 34, p. 22–39, 1983.
8. G.R. Grimmet and C.J. McDiarmid, “On colouring random graphs,” Math. Proc. Camb. Phil. Soc., no. 77, p. 313–324, 1975.
9. G.D. Hachtel, A.R. Newton, and A.L. Sangiovanni-Vincentelli. “An algorithm for optimal PLA folding,” IEEE Trans. Computer-Aided Design, vol. CAD-1, pp. 63–76, Apr. 1982.
10. S.Y. Hwang, R.W. Dutton, and T. Blank, “A best-first search algorithm for optimal PLA folding,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 433–442, July 1986.
11. D.S. Johnson, “Approximation algorithms for combinatorial problems,” J. Comp. Syst. Sci., no. 9, pp. 256–278, 1974.
12. M. Luby, U. Vazirani, V. Vazirani, and A. Sangiovanni-Vincentelli. “Some theoretical results on the optimal PLA folding problem,” in Proc. IEEE Conf. on Circuits and Computers, pp. 165–170, 1982.
13. E.M. Palmer, Graphical Evolution, An Introduction to the Theory of Random Graphs. New York: Wiley-Interscience, 1985.
14. V.K. Wei, “A lower bound on the stability number of a simple graph,” Bell Labs. Tech. Memo. 81-11217–9, 1981.