A global constraint for graph isomorphism problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3011, Issue , 2004, Pages 287-301

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

^a UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION; SEMANTICS; SET THEORY;

CONSTRAINT PROGRAMMING; FILTERING ALGORITHM; GENERIC TOOLS; GLOBAL CONSTRAINTS; GRAPH ISOMORPHISM PROBLEM; IDENTICAL STRUCTURES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048887063     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_20     Document Type: Article

References (21)

1. Abderrahmane Aggoun and Nicolas Beldiceanu. Extending CHIP in order to solve complex and scheduling and placement problems. In Actes des Journées Francophones de Programmation et Logique, Lille, France, 1992.
2. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The design and analysis of computer algorithms. Addison Wesley, 1974.
3. Christian Bessière and Marie-Odile Cordier. Arc-consistency and arc-consistency again. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 108-113, Menlo Park, CA, USA, July 1993. AAAI Press.
4. Christian Bessière and Pascal Van Hentenryck. To be or not to be... a global constraint. CP'03, Kinsale, Ireland, pages 789-794, 2003.
5. Christian Bessière and Jean-Charles Régin. Refining the basic constraint propagation algorithm. In Bernhard Nebel, editor, Proceedings of the seventeenth International Conference on Artificial Intelligence (IJCAI-01), pages 309-315, San Francisco, CA, August 4-10 2001. Morgan Kaufmann Publishers, Inc.
6. Pierre-Antoine Champin and Christine Solnon. Measuring the similarity of labeled graphs. 5th International Conference on Case-Based Reasoning (ICCBR 2003), Lecture Notes in Artificial Intelligence No. 2689 - Springer-Verlag:80-95, 2003.
7. Luigi Pietro Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. An improved algorithm for matching large graphs. In 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pages 149-159. Cuen, 2001.
8. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, 1990.
9. Pasquale Foggia, Carlo Sansone, and Mario Vento. A performance comparison of five algorithms for graph isomorphism. In 3rd IAPR-TC15 Workshop on Graphbased Representations in Pattern Recognition, pages 188-199. Cuen, 2001.
10. Scott Fortin. The graph isomorphism problem. Technical report, Dept of Computing Science, Univ. Alberta, Edmonton, Alberta, Canada, 1996.
11. Michael R. Garey and David S. Johnson. Computers and Intractability : A Guide to The Theory of NP-Completness. W.H. Freeman, San Francisco, 1979.
12. th Annu. ACM Symp. theory of Comput., pages 172-184, 1974.
13. ILOG, S. A. ILOG Solver 5.0 User's Manual and Reference Manual. 2000.
14. François Laburthe and the OCRE project team. CHOCO: implementing a CP kernel. In Proc. of the CP'2000 workshop on techniques for implementing constraint programming systems, Singapore, 2000.
15. Eugene M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, pages 42-65, 1982.
16. James J. McGregor. Relational consistency algorithms and their applications in finding subgraph and graph isomorphisms. Information Science, 19:229-250, 1979.
17. Brendan D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
18. Roger Mohr and Thomas C. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:65-74, 1986.
19. Jean-Charles Régin. Développement d'Outils Algorithmiques pour l'Intelligence Artificielle. Application á la Chimie Organique. PhD thesis, Univ. Montpellier II, 1995.
20. Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
21. Jeffrey D. Ullman. An algorithm for subgraph isomorphism. Journal of the Association of Computing Machinery, 23(1):31-42, 1976.