Constraint satisfaction algorithms for graph pattern matching

Mathematical Structures in Computer Science

Volumn 12, Issue 4, 2002, Pages 403-422

  Larrosa, Javier ^a   Valiente, Gabriel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3142727130     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003577     Document Type: Article

References (51)

1. Akinniyi, F. A., Wong, A. K. C. and Stacey, D. A. (1986) A new algorithm for graph monomorphism based on the projections of the product graph. IEEE Trans, on Systems, Man, and Cybernetics 16 (5) 740–751.
2. Barnard, J.M. (1993) Substructure searching methods: Old and new. J. Chem. Inf. Comp. Sci. 33 (4) 532–538.
3. Barrow, H. G. and Burstall, R. M. (1976) Subgraph isomorphism, matching relational structures and maximal cliques. Inform. Process. Lett. 4 (4) 83–84.
4. Berztiss, A. T. (1973) A backtrack procedure for isomorphism of directed graphs. J. ACM 20 (3) 365–377.
5. Bessiere, C. (1994) Arc consistency and arc consistency again. Artif. Intell. 65 (1) 179–190.
6. Bessiere, C., Freuder, E. C. and Regin, J.-C. (1999) Using constraint metaknowledge to reduce arc consistency computation. Artif. Intell. 107 (1) 125–148.
7. Bessiere, C., Meseguer, P., Freuder, E. C. and Larrosa, J. (1999) On forward checking for non-binary constraint satisfaction. In: Principles and Practice of Constraint Programming. Springer-Verlag Lecture Notes in Computer Science 1713 88–102.
8. Bessiere, C. and Regin, J.-C. (1996) MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) ?) on Hard Problems. In Proc. 2nd Int. Conf. Constraint Programming, Cambridge, MA, USA 61–75.
9. Bessiere, C. and Regin, J.-C. (1997) Arc consistency for general constraint networks: Preliminary results. Proc. 15th Int. Joint Conf. Artificial Intelligence 398–404.
10. Bunke, H. (1993) Structural and syntactic pattern recognition. In: Chen, C. H., Pau, L. F. and Wang, P. S. P. (eds.) Handbook of Pattern Recognition and Computer Vision, Chapter 1.5, World Scientific 163–209.
11. Bunke, H., Glauser, T. and Tran, T.-H. (1991) An efficient implementation of graph grammars based on the RETE matching algorithm. Graph-Grammars and their Application to Computer Science. Springer-Verlag Lecture Notes in Computer Science 532 174–189.
12. Bunke, H. and Messmer, B. T. (1997) Recent advances in graph matching. Int. J. Pattern Recogn. 11 (1) 169–203.
13. Cheng, J. K. and Huang, T. S. (1981) A subgraph isomorphism algorithm using resolution. Pattern Recognition 13 (5) 371–379.
14. Christmas, W. J., Kittler, J. and Petrou, M. (1995) Structural matching in computer vision using probabilistic relaxation. IEEE T. Pattern Anal. 17 (8) 749–764.
15. Cortadella, J. and Valiente, G. (2000) A relational view of subgraph isomorphism. Proc. 5th Int. Seminar on Relational Methods in Computer Science, Quebec, Canada 45–54.
16. Cross, A.D.J., Wilson, R. C. and Hancock, E. R. (1997) Inexact graph matching using genetic search. Pattern Recogn. 30 (6) 953–970.
17. Dechter, R. (1992) Constraint networks. In: Shapiro, S. C. (ed.) Encyclopedia of Artificial Intelligence, Volume 1, second edition, Wiley 276–285.
18. Freuder, E. C. (1982) A sufficient condition for backtrack-free search. J. ACM 29 (1) 24–32.
19. Garey, M. R. and Johnson, D. S. (1979) Computers and intractability: A guide to NP-completeness, Freeman.
20. Ghahraman, D. E., Wong, A. K. C. and Au, T. (1980) Graph monomorphism algorithms. IEEE Trans, on Systems, Man, and Cybernetics 10 (4) 189–197.
21. Haralick, R. M. and Elliot, G. (1980) Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14 (3) 263–313.
22. Haralick, R. M. and Kartus, J. S. (1978) Arrangements, homomorphisms, and discrete relaxation. IEEE T. Syst. Man Cyb. 8 (8) 600–612.
23. Kasif, S., Kitchen, L. and Rosenfeld, A. (1983) A Hough transform technique for subgraph isomorphism. Pattern Recogn. Lett. 2 (2) 83–88.
24. Kitchen, L. (1980) Relaxation applied to matching quantitative relational structures. IEEE T. Syst. Man Cyb. 10 (2) 96–101.
25. Kitchen, L. and Rosenfeld, A. (1979) Discrete relaxation for matching relational structures. IEEE T. Syst. Man Cyb. 9 (12) 869–874.
26. Knuth, D. E. (1993) The Stanford GraphBase: A Platform for Combinatorial Computing, ACM Press.
27. Kondrak, G. and Beek, P.V. (1997) A theoretical evaluation of selected backtracking algorithms. Artif. Intell. 89 (1–2) 365–387.
28. Kuner, P. and Ueberreiter, B. (1988) Pattern recognition by graph matching—combinatorial versus continuous optimization. Int. J. Pattern Recogn. 2 527–542.
29. Levi, G. (1972) A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9 (4) 1–12.
30. Levy, S. and Knuth, D. E. (1994) The CWEB System of Structured Documentation, Addison-Wesley.
31. Lowe, M., Korff, M. and Wagner, A. (1993) An algebraic framework for the transformation of attributed graphs. In: Sleep, R., Plasmeijer, R. and van Eekelen, M. (eds.) Term Graph Rewriting.'Theory and Practice, John Wiley & Sons 185–199.
32. Mackworth, A. K. (1977) Consistency in networks of relations. Artif. Intel'. 8 (1) 99–118.
33. Mackworth, A. K. (1992) Constraint satisfaction. In: Shapiro, S. C. (ed.) Encyclopedia of Artificial Intelligence, Volume 1, second edition, Wiley 285–293.
34. McGregor, J. J. (1979) Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Sciences 19 229–250.
35. McGregor, J. J. (1982) Backtrack search algorithms and the maximal common subgraph problem. Software—Practice and Experience 12 (1) 23–34.
36. Mehlhorn, K. and Naher, S. (1999) The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press.
37. Mohr, R. and Henderson, T. C. (1986) Arc and path consistency revisited. Artif. Intell. 28 (1) 225–233.
38. Mohr, R. and Masini, G. (1988) Good old discrete relaxation. Proc. 8th European Conf. Artificial Intelligence 651–656.
39. Nudel, B. (1988) Tree search and arc consistency in constraint satisfaction algorithms. In: Kanal, L. N. and Kumar, V. (eds.) Search in Artificial Intelligence, Springer-Verlag 287–342.
40. Ohlrich, M., Ebeling, C., Ginting, E. and Sather, L. (1993) SubGemini: Identifying subcircuits using a fast subgraph isomorphism algorithm. Proc. 30th Annual ACM/IEEE Design Automation Conf. 31–37.
41. Park, S. K. and Miller, K.W. (1988) Random number generators, good ones are hard to find. Commun. ACM 31 (10) 1192–1201.
42. Regin, J.-C. (1994) A filtering algorithm for constraints of difference in CSPs. Proc. 12th Conf. American Assoc. Artificial Intelligence 1 362–367.
43. Rudolf, M. (2000) Utilizing constraint satisfaction techniques for efficient graph pattern matching. In: Theory and Application of Graph Transformations. Springer-Verlag Lecture Notes in Computer Science 1764 215–227.
44. Schlieder, C. (1998) Diagrammatic transformation processes on two-dimensional relational maps. Journal of Visual Languages and Computing 9 (1) 45–59.
45. Tsang, E. (1993) Foundations of Constraint Satisfaction, Academic Press.
46. Ullmann, J. R. (1976) An algorithm for subgraph isomorphism. J. ACM 23 (1) 31–42.
47. Valiente G. and Martinez, C. (1997) An algorithm for graph pattern-matching. Proc. 4th South American Workshop on String Processing. Int. Informatics Series 8, Carleton University Press 180–197.
48. Wallace, M. (1996) Practical applications of constraint programming. Constraints: An International Journal 1 (1–2) 139–168.
49. Wilson, R. C., Evans, A. N. and Hancock, E. R. (1995) Relational matching by discrete relaxation. Image and Vision Computing 13 (5) 411–421.
50. Wong, E. K. (1992) Model matching in robot vision by subgraph isomorphism. Pattern Recogn. 25 (3) 287–303.
51. Zündorf A. (1996) Graph pattern matching in PROGRES. Graph Grammars and their Application to Computer Science. Springer-Verlag Lecture Notes in Computer Science 1073 454–468.