Filtering for subgraph isomorphism

  • Authors:

  • Stéphane Zampelli;Yves Deville;Christine Solnon;Sébastien Sorlin;Pierre Dupont

  • Affiliations:

  • Université catholique de Louvain, Department of Computing Science and Engineering, Louvain-la-Neuve, Belgium;Université catholique de Louvain, Department of Computing Science and Engineering, Louvain-la-Neuve, Belgium;LIRIS, CNRS, UMR, University of Lyon I, Villeurbanne Cedex, France;LIRIS, CNRS, UMR, University of Lyon I, Villeurbanne Cedex, France;Université catholique de Louvain, Department of Computing Science and Engineering, Louvain-la-Neuve, Belgium

  • Venue:
  • CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A 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 filtering algorithm dedicated to this problem. The main idea 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 the 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 CP approaches.