Author:
Ichikawa Shuichi,Saito Hidemitsu,Udorn Lerdtanaseangtham,Konishi Kouji
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979.
2. J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, Vol. 23, No. 1, pp. 31–42, 1976.
3. M. J. Swain and P. R. Cooper. Parallel hardware for constraint satisfaction. In Seventh National Conference on Artificial Intelligence (AAAI’ 88), pp. 2:682–686. Morgan Kaufmann, 1988.
4. C. Cherry and P. K. T. Vaswani. A new type of computer for problems in propositional logic, with greatly reduced scanning procedures. Information and Control, Vol. 4, pp. 155–168, 1961.
5. J. R. Ullmann, R. M. Haralick, and L. G. Shapiro. Computer architecture for solving consistent labelling problems. Computer Journal, Vol. 28, No. 2, pp. 105–111, May 1985.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献