An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)

Volumn 23, Issue 1, 1976, Pages 31-42

  Ullmann, J R ^a  

^a NATIONAL PHYSICAL LABORATORY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

COMPUTER PROGRAMMING;

EID: 0016870630     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321921.321925     Document Type: Article

References (11)

1. Barrow, H. G., Ambler, A. P., and Burstall, R. M. Some techniques for recognising structures in pictures. In Frontiers of Pattern Recognition, S. Watanabe, Ed., Academic Press, New York, 1972, pp. 1-29.
2. Berztiss, A. T. A backtrack procedure for isomorphism of directed graphs. J. ACM 20, 3 (July 1973), 365-377.
3. Bron, C, and Kerbosch, J Algorithm 457. Finding all cliques in an undirected graph [H] Comm. ACM 16, 9 (Sept. 1973), 575-577.
4. Corneil, D. G., and Gotlieb, C C. An efficient algorithm for graph isomorphism J. ACM 17, 1 (Jan 1970), 51-64.
5. Harary, F Graph Theory. Addison-Wesley, Reading, Mass, 1969.
6. Levitt, K. N., and Kautz, W. H. Cellular arrays for the solution of graph problems Comm. ACM 15, 9 (Sept 1972), 789-801.
7. Nilsson, N. J. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 1971.
8. Osteen, R. E., and Tou, J. T. A clique-detection algorithm based on neighbourhoods in graphs. Int J of Comput and Inform Scis 2, 4 (Dec. 1973), 257-268.
9. Pike, M C, and Hill, I. D. Algorithm 266: Pseudo-random numbers [G5]. Comm. ACM 8, 10 (Oct 1965), 605-606.
10. Sakai, T., Nagao, M., and Matsushima, H. Extraction of invariant picture substructures by computer. Comput Graphics and Image Process 1, 1 (April 1972), 81-96.
11. Ullmann, J. R. Pattern Recognition Techniques. Butterworths, London, and Crane Russak, New York, 1973.