A parametric filtering algorithm for the graph isomorphism problem

Constraints

Volumn 13, Issue 4, 2008, Pages 518-537

  Sorlin, Sébastien ^a   Solnon, Christine ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

Filtering algorithm; Global constraint; Graph isomorphism

Indexed keywords

LABELING; LABELS; SET THEORY; SIGNAL FILTERING AND PREDICTION;

BASIC IDEA; FILTERING ALGORITHM; FILTERING ALGORITHMS; GLOBAL CONSTRAINT; GLOBAL CONSTRAINTS; GRAPH ISOMORPHISM; GRAPH ISOMORPHISM PROBLEM; OF GRAPHS; PARAMETERIZED; PARAMETRIC FILTERING; POSITIVE INTEGERS; SPARSE GRAPHS;

GRAPH THEORY;

EID: 52949143795     PISSN: 13837133     EISSN: 15729354     Source Type: Journal    
DOI: 10.1007/s10601-008-9044-1     Document Type: Article

References (25)

1. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1974). The design and analysis of computer algorithms. Redwood City: Addison Wesley.
2. Barabasi, A.-L. (2003). Linked: How everything is connected to everything else and what it means. New York: Plume.
3. Bessière, C., & Van Hentenryck, P. (2003). To be or not to be. A global constraint. In CP'03. Kinsale, Ireland (pp. 789-794). New York: Springer.
4. Champin, P.-A., & Solnon, C. (2003). Measuring the similarity of labeled graphs. In 5th International conference on case-based reasoning (ICCBR 2003). Lecture notes in artificial intelligence (Vol. 2689, pp. 80-95). New York: Springer.
5. L. P. Cordella P. Foggia C. Sansone M. Vento 2004 A (sub)graph isomorphism algorithm for matching large graphs Transactions on Pattern Analysis and Machine Intelligence 26 10 1367 1372
6. Darga, P. T., Liffiton, M. H., Sakallah, K. A., & Markov, I. L. (2004). Exploiting structure in symmetry detection for cnf. In DAC (pp. 530-554). Piscataway: IEEE.
7. Foggia, P., Sansone, C., & Vento, M. (2001). A performance comparison of five algorithms for graph isomorphism. In 3rd IAPR-TC15 workshop on graph-based representations in pattern recognition (pp. 188-199). Cuen.
8. Fortin, S. (1996). The graph isomorphism problem. Technical report, Dept. of Computing Science, Univ. Alberta, Edmonton, Alberta, Canada.
9. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability : A guide to the theory of NP-completness. San Francisco: W. H. Freeman.
10. th annual ACM symposium on the theory of computing (pp. 172-184).
11. ILOG, S. A. (2000). ILOG Solver 5.0 user's manual and reference manual.
12. Laburthe, F., & OCRE (2000). CHOCO: Implementing a CP kernel. In Proc. of the CP'2000 workshop on techniques for implementing constraint programming systems. Singapore.
13. E. M. Luks 1982 Isomorphism of graphs of bounded valence can be tested in polynomial time Journal of Computer System Science 25 42 65
14. J. J. McGregor 1979 Relational con sistency algorithms and their applications in finding subgraph and graph isomorphisms Information Science 19 229 250
15. B. D. McKay 1981 Practical graph isomorphism Congressus Numerantium 30 45 87
16. J.-F. Puget 2005 Automatic detection of variable and value symmetries Principles and practice of constraint programming - CP 2005 3709 475 489
17. Régin, J.-C. (1995). Développement d'Outils Algorithmiques pour l'Intelligence Artificielle. Application à la Chimie Organique. Ph.D. thesis, Univ. Montpellier II.
18. D. Schmidt L. Druffel 1976 A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices Journal of the ACM (JACM) 23 3 433 445
19. Sorlin, S., & Solnon, C. (2004). A global constraint for graph isomorphism problems. In The 6th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems (CP-AI-OR 2004), number 3011 in LNCS (pp. 287-301). Avril: Springer.
20. Sorlin, S., & Solnon, C. (2007). A new filtering algorithm for the graph isomorphism problem. Constraint propagation and implementation. In F. Benhamou, N. Jussien, & B. O'Sullivan (Eds.), Trends in constraint programming (pp. 103-107). Washington, DC: ISTE.
21. Tsang, E. (1993). Foundations of constraint satisfaction. London: Academic.
22. J. D. Ullman 1976 An algorithm for subgraph isomorphism Journal of the Association of Computing Machinery 23 1 31 42
23. P. Van Hentenryck H. Simonis M. Dincbas 1992 Constraint satisfaction using constraint logic programming Artificial Intelligence 58 1-3 113 159
24. Zampelli, S., Deville, Y., & Dupont, P. (2006). Elimination des symétries pour l'appariement de graphes. In L. Henocque (Ed.), JFPC'06, Deuxièmes Journées Francophones de Programmation par Contraintes (pp. 357-367).
25. Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., & Dupont, P. (2007). Filtering for subgraph isomorphism. In Principles and practice of constraint programming (CP'2007), number 4741 in LNCS (pp. 728-742). New York: Springer.