AllDifferent-based filtering for subgraph isomorphism

Artificial Intelligence

Volumn 174, Issue 12-13, 2010, Pages 850-864

  Solnon, Christine ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

All different constraint; Constraint programming; Subgraph isomorphism

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; SET THEORY;

ALL DIFFERENT CONSTRAINT; ALLDIFFERENT; BASED FILTERING; CONSTRAINT PROGRAMMING; FILTERING ALGORITHM; FILTERING TECHNIQUE; SUBGRAPH ISOMORPHISM; SUBGRAPH ISOMORPHISM PROBLEM;

FILTRATION;

EID: 77953714503     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2010.05.002     Document Type: Article

References (20)

1. Bessiere C., and Debruyne R. Theoretical analysis of singleton arc consistency and its extensions. Artif. Intell. 172 1 (2008) 29-41
2. Cordella L.P., Foggia P., Sansone C., and Vento M. Performance evaluation of the vf graph matching algorithm. ICIAP '99: Proceedings of the 10th International Conference on Image Analysis and Processing (1999), IEEE Computer Society, Washington, DC, USA 1172
3. Luigi Pietro Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento, An improved algorithm for matching large graphs, in: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, 2001, pp. 149-159
4. Conte D., Foggia P., Sansone C., and Vento M. Thirty years of graph matching in pattern recognition. IJPRAI 18 3 (2004) 265-298
5. Pasquale Foggia, Carlo Sansone, Mario Vento, A database of graphs for isomorphism and sub-graph isomorphism benchmarking, in: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, 2001
6. Garey M., and Johnson D. Computers and Intractability (1979), Freeman and Co., New York
7. 5 / 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2 4 (1973) 225-231
8. Van Hentenryck P., and Michel L. Constraint-Based Local Search (2005), The MIT Press
9. le Clément V., Deville Y., and Solnon C. Constraint-based graph matching. 15th Conference on Principles and Practice of Constraint Programming (CP). LNCS vol. 5732 (2009), Springer 274-288
10. Lecoutre C. Constraint Networks: Techniques and Algorithms (2009), ISTE/Wiley
11. C. Lecoutre, S. Tabary, Abscon 112: towards more robustness, in: 3rd International Constraint Solver Competition (CSC'08), 2008, pp. 41-48
12. Larrosa J., and Valiente G. Constraint satisfaction algorithms for graph pattern matching. Mathematical Structures in Comp. Sci. 12 4 (2002) 403-422
13. McGregor J.J. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19 3 (1979) 229-250
14. Mohr R., and Henderson T.C. Arc and path consistency revisited. Artif. Intell. 28 (1986) 225-233
15. Jean-Charles Régin, Développement d'outils algorithmiques pour l'intelligence artificielle. Application à la chimie organique, PhD thesis, 1995
16. Régin J.-C. A filtering algorithm for constraints of difference in CSPs. Proc. 12th Conf. American Assoc. Artificial Intelligence, vol. 1 (1994), Amer. Assoc. Artificial Intelligence 362-367
17. Rossi F., van Beek P., and Walsh T. Handbook of Constraint Programming (Foundations of Artificial Intelligence) (2006), Elsevier Science Inc., New York, NY, USA
18. Ullmann J.R. An algorithm for subgraph isomorphism. J. ACM 23 1 (January 1976) 31-42
19. David L. Waltz, Generating semantic descriptions from drawings of scenes with shadows, Technical Report AI-TR-271, MIT Artificial Intelligence Laboratory, 1972
20. S. Zampelli, Y. Deville, C. Solnon, Solving subgraph isomorphism problems with constraint programming, Constraints (2010), in press, doi:10.1007/s10601-009-9074-3