Filtering for subgraph isomorphism

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

Volumn 4741 LNCS, Issue , 2007, Pages 728-742

  Zampelli, Stéphane ^a   Deville, Yves ^a   Solnon, Christine ^b   Sorlin, Sébastien ^b   Dupont, Pierre ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PROCESSING; ITERATIVE METHODS; PATTERN RECOGNITION; PROBLEM SOLVING;

STATE-OF-THE-ART ALGORITHMS; SUBGRAPH ISOMORPHISM;

GRAPH THEORY;

EID: 38149064599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_51     Document Type: Conference Paper

References (18)

1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265-298 (2004)
2. Garey, M., Johnson, D.: Computers and Intractability. Freeman and Co., New York (1979)
3. Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31-42 (1976)
4. Cordella, L., Foggia, P., Sansone, C., Vento, M.: An improved algorithm for matching large graphs. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, Cuen, pp. 149-159 (2001)
5. Zampelli, S., Deville, Y., Dupont, P.: Approximate constrained subgraph matching. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 832-836. Springer, Heidelberg (2005)
6. Régin, J.: Développement d'Outils Algorithmiques pour l'Intelligence Artificielle. Application à la Chimie Organique. PhD thesis (1995)
7. Rudolf, M.: Utilizing constraint satisfaction techniques for efficient graph pattern matching. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 238-252. Springer, Heidelberg (2000)
8. Larrosa, J., Valiente, G.: Constraint satisfaction algorithms for graph pattern matching. Mathematical. Structures in Comp. Sci. 12(4), 403-422 (2002)
9. McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45-87 (1981)
10. Darga, P.T., Liffiton, M.H., Sakallah, K.A., Markov, I.L.: Exploiting structure in symmetry detection for cnf. In: Proc. Design Automation Conference (DAC), pp. 530-534. IEEE/ACM (2004)
11. Sorlin, S., Solnon, C.: A global constraint for graph isomorphism problems. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 287-301. Springer, Heidelberg (2004)
12. Sorlin, S., Solnon, C.: A new filtering algorithm for the graph isomorphism problem. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204. Springer, Heidelberg (2006)
13. Regin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Amer. Assoc. Artificial Intelligence. Proc. 12th Conf. American Assoc. Artificial Intelligence, vol. 1, pp. 362-367 (1994)
14. Zampelli, S., Deville, Y., Solnon, C., Sorlin, S., Dupont, P.: Filtering for subgraph matching. Technical Report INGIRR2007-03, Université Catholique de Louvain (2007)
15. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225-231 (1973)
16. Barabasi, A.L.: Linked: How Everything Is Connected to Everything Else and What It Means. Plume (2003)
17. Dooms, G., Deville, Y., Dupont, P.: Cp(graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 211-225. Springer, Heidelberg (2005)
18. Deville, Y., Dooms, G., Zampelli, S., Dupont, P.: Cp(graph+map) for approximate graph matching. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 33-48. Springer, Heidelberg (2005)