This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Booth, K. S. and Lueker, G. S., “Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms”, Journal of Computer and System Sciences 13, pp. 335–379, 1976.
Deo, N., Krishnamoorthy, M. S. and Langston, M. A., “Exact and approximate solutions for the gate matrix layout problem”, IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 79–84, January 1987.
Fellows, M. R. and Langston, M. A., “Nonconstructive advances in polynomial-time complexity”, Information Processing Letters, 26, pp. 157–162, 1987.
Ferreira, A. G., “An Optimal O(n2) algorithm to fold special PLA's”, in Lecture Notes in Economics and Mathematical Systems, No. 302, Proceedings of the Conference “Optimization Days 86”, Montreal, Canada, April 30–May 2, 1986, H. A. Eiselt and G. Pederzoli (eds.), pp. 92–102, Springer-Verlag, 1988.
Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
Hachtel, G. D., Newton, A. R. and Sangiovanni-Vicentelli, A. L., “An Algorithm for optimal PLA folding”, IEEE Trans. Computer-Aided Design, vol. CAD-1, pp. 63–76, January 1982.
Hwang, S. Y., Dutton, R. W. and Blank, T., “A best-first search for optimal PLA folding”, IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 433–442, July 1986.
Kashiwabara, T. and Fujisawa, T., “An NP-complete problem on interval graph”, Proc. 1979 IEEE Int. Symposium on Circuits and Systems, pp. 82–83, 1979.
Kinnersley, N. G. and Langston, M. A., “Obstruction set isolation for the gate matrix layout problem”, Technical Report, Department of Computer Science, University of Tennessee, Knoxville, January, 1991.
Lecky, J.E., Murphy, O. J. and Absher, R. G., “Graph-Theoretic Algorithms for the PLA folding problem”, IEEE Trans. Computer-Aided Design, vol. CAD-8, pp. 1014–1021, September 1989.
Luby, M., Vazirani, U., Vazirani, V. and Sangiovanni-Vicentelli, A., “Some theoretical results on the optimal PLA folding problem”, in Proceedings IEEE Conf. on Circuits and Computers, pp. 165–170, 1982.
Micali, S. and Vazirani, V. V., “An O(¦V¦1/2¦E¦) algorithm for finding maximum matching in general graphs”, Proceedings 21st Annual Symposium on Foundations of Computer Science, IEEE, pp. 17–27, 1980.
Möhring, R. H., “Graph problems related to gate matrix layout and PLA folding”, Technical Report no. 223, Technical University of Berlin, 1989.
Paillotin, J. F., “Optimization of the PLA area”, Proceedings 18th Design Automation Conference, pp. 406–410, June 1981.
Pape, U. and Conradt, D. “Maximales matching in Graphen”, in H. Späth (ed.) Augewählte operations research in Fortran, Oldenburg, Munich, pp. 103–114, 1980.
Syslo, M. M., Deo, N. and Kowalik, J. S. Discrete Optimization Algorithms, Prentice Hall, 1983.
Tucker, A. C., “A structure theorem for the consecutive ones property”, Journal Combinatorial Theory 12(B), pp. 153–162, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferreira, A.G., Song, S.W. (1992). Achieving optimality for gate matrix layout and PLA folding: A graph theoretic approach. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023825
Download citation
DOI: https://doi.org/10.1007/BFb0023825
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55284-0
Online ISBN: 978-3-540-47012-0
eBook Packages: Springer Book Archive