AllDifferent-based filtering for subgraph isomorphism

[1]  S. Zampelli,et al.  Solving subgraph isomorphism problems with constraint programming , 2010, Constraints.

[2]  Christophe Lecoutre Constraint Networks: Techniques and Algorithms , 2009 .

[3]  Yves Deville,et al.  Constraint-Based Graph Matching , 2009, CP.

[4]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[5]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[6]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[7]  Javier Larrosa,et al.  Constraint satisfaction algorithms for graph pattern matching , 2002, Mathematical Structures in Computer Science.

[8]  P. Foggia,et al.  Performance evaluation of the VF graph matching algorithm , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[9]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[10]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[11]  J. J. McGregor Relational consistency algorithms and their application in finding subgraph and graph isomorphisms , 1979, Inf. Sci..

[12]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[13]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[14]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[15]  Christian Bessiere,et al.  Theoretical analysis of singleton arc consistency and its extensions , 2008, Artif. Intell..

[16]  Mario Vento,et al.  A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking , 2001 .

[17]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[18]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[19]  M. Garey Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .