Solving subgraph isomorphism problems with constraint programming

The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated filtering algorithm to solve this problem within the context of constraint programming. The main idea of the filtering algorithm is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph isomorphism. This partial order over labels is used to filter domains. Labelings can also be strengthened by adding information from the labels of neighbors. Such a strengthening can be applied iteratively until a fixpoint is reached. Practical experiments illustrate that our new filtering approach is more effective on difficult instances of scale free graphs than state-of-the-art algorithms and other constraint programming approaches. Keywords Subgraph isomorphism

• Type: Journal
• Year: 2010
• Where: CONSTRAINTS
• Authors: Stéphane Zampelli, Yves Deville, Christine Solnon
• Keywords: Computer Networks, CONSTRAINTS 2010, Filtering Algorithm, Labels, Subgraph Isomorphism