Author:
Abraham Steffen,Voss Klaus
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. F. A. Akinniyi, A. Wong, and D. A. Stacey. A new algorithm for graph monomorphism based on the projections of the product graph. IEEE Transactions on Systems, Man and Cybernetics, 16 (5): 740–751, 1986.
2. A. T. Berztiss. A backtrack procedure for isomorphism of directed graphs. Journal of the ACM, 20 (3), 1973.
3. L. Cinque, D. Yasuda, G. Shapiro, S. Tanimoto, and B. Allen. An improved algorithm for relational distance graph matching. Pattern Recognition, 29 (2): 349–359, 1996.
4. C. Gottlieb D. Corneil. An efficient algorithm for graph isomorphism. Journal of the ACM, 17 (1): 51–64, 1970.
5. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completnes. Freeman, San Francisco, CA, 1979.