Abstract
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very straightforward way, so that one can use constraint programming to solve it. However, constraint programming is a generic tool that may be less efficient than dedicated algorithms which can take advantage of the global semantic of the original problem.
Hence, we introduce in this paper a new global constraint dedicated to graph isomorphism problems, and we define an associated filtering algorithm that exploits all edges of the graphs in a global way to narrow variable domains. We then show how this global constraint can be decomposed into a set of “distance” constraints which propagate more domain reductions than “edge” constraints that are usually generated for this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex and scheduling and placement problems. In: Actes des Journées Francophones de Programmation et Logique, Lille, France (1992)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison Wesley, Reading (1974)
Bessière, C., Cordier, M.-O.: Arc-consistency and arc-consistency again. In: Proceedings of the 11th National Conference on Artificial Intelligence, July 1993, pp. 108–113. AAAI Press, Menlo Park (1993)
Bessière, C., Van Hentenryck, P.: To be or not to be.. a global constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 789–794. Springer, Heidelberg (2003)
Bessière, C., Régin Refining, J.-C.: the basic constraint propagation algorithm. In: Nebel, B. (ed.) Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI 2001), August 4-10, pp. 309–315. Morgan Kaufmann Publishers, Inc., San Francisco (2001)
Champin, P.-A., Solnon, C.: Measuring the similarity of labeled graphs. In: Ashley, K.D., Bridge, D.G. (eds.) ICCBR 2003. LNCS (LNAI), vol. 2689, pp. 80–95. Springer, Heidelberg (2003)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 149–159. Cuen (2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Foggia, P., Sansone, C., Vento, M.: A performance comparison of five algorithms for graph isomorphism. In: 3rd IAPR-TC15 Workshop on Graphbased Representations in Pattern Recognition, pp. 188–199. Cuen (2001)
Fortin, S.: The graph isomorphism problem. Technical report, Dept of Computing Science, Univ. Alberta, Edmonton, Alberta, Canada (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability : A Guide to The Theory of NP-Completness. W.H. Freeman, San Francisco (1979)
Hopcroft, J.E., Wong, J.-K.: Linear time algorithm for isomorphism of planar graphs. In: 6th Annu. ACM Symp. theory of Comput., pp. 172–184 (1974)
ILOG,S.A. ILOG Solver 5.0 User’s Manual and Reference Manual (2000)
Laburthe, F., and the OCRE project team: CHOCO: implementing a CP kernel. In: Proc. of the CP 2000 workshop on techniques for implementing constraint programming systems, Singapore (2000)
Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, 42–65 (1982)
McGregor, J.J.: Relational consistency algorithms and their applications in finding subgraph and graph isomorphisms. Information Science 19, 229–250 (1979)
McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45–87 (1981)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 65–74 (1986)
Régin, J.-C.: Développement d’Outils Algorithmiques pour l’Intelligence Artificielle. Application á la Chimie Organique. PhD thesis, Univ. Montpellier II (1995)
Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)
Ullman, J.D.: An algorithm for subgraph isomorphism. Journal of the Association of Computing Machinery 23(1), 31–42 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sorlin, S., Solnon, C. (2004). A Global Constraint for Graph Isomorphism Problems. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive