A global constraint for graph isomorphism problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

A global constraint for graph isomorphism problems


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.
Fichier principal
Vignette du fichier
cpaior04-submitted.pdf (275.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01541511 , version 1 (24-03-2020)



Sébastien Sorlin, Christine Solnon. A global constraint for graph isomorphism problems. The 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems ( CP-AI-OR 2004 ), Apr 2004, Nice, France. pp.287-301, ⟨10.1007/978-3-540-24664-0_20⟩. ⟨hal-01541511⟩
97 View
119 Download



Gmail Facebook Twitter LinkedIn More