A generic graph distance measure based on multivalent matchings

Studies in Computational Intelligence

Volumn 52, Issue , 2007, Pages 151-181

  Sorlin, Sébastien ^a   Solnon, Christine ^a   Jolion, Jean Michel ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34147205101     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-68020-8_6     Document Type: Article

References (33)

1. H. Bunke. Graph matching: Theoretical foundations, algorithms, and applications. In Proceedings on Vision Interface 2000, Montreal, pages 82-88, 2000
2. R. Ambauen, S. Fischer, and H. Bunke. Graph edit distance with node splitting and merging, and its application to diatom identification. In E. Hancock and M. Vento, editors, IAPR-TC15 Wksp on Graph-based Representation in Pattern Recognition, volume 2726 of LNCS, Springer, Berlin Heidelberg New York, pages 95-106, 2003
3. R. Baeza-Yates and G. Valiente. An image similarity measure based on graph matching. In Proceedings of 7th International Symposium on String Processing and Information Retrieval, pages 28-38. IEEE Computer Science Press, 2000
4. M. Boeres, C. Ribeiro, and I. Bloch. A randomized heuristic for scene recognition by graph matching. In WEA 2004, pages 100-113, 2004
5. A. Hlaoui and S.Wang. A new algorithm for graph matching with application to content-based image retrieval. LNCS, volume 2396, 2002
6. P.-A. Champin and C. Solnon. Measuring the similarity of labeled graphs. In 5th International Conference on Case-Based Reasoning (ICCBR 2003 volume Lecture Notes in Artificial Intelligence 2689-Springer, Berlin Heidelberg New York, pages 80-95, 2003
7. T. Akutsu. Protein structure alignment using a graph matching technique, citeseer.nj. nec.com/akutsu95protein.html, 1995
8. L. Holm and C. Sander. Mapping the protein universe. Science, 273:595-602, 1996
9. A. Schenker, M. Last, H. Bunke, and A. Kandel. Classification of web documents using graph matching. International Journal of Pattern Recognition and Artificial Intelligence, 18(3): 475-496, 2004
10. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18: 689-694, 1997
11. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence, 18(3): 265-298, 2004
12. A. Deruyver, Y. Hod, E. Leammer, and J.-M. Jolion. Adaptive pyramid and semantic graph: Knowledge driven segmentation. In L. Brun and M. Vento, editors, Graph-Based Representations in Pattern Recognition: 5th IAPR InternationalWorkshop, GbRPR 2005, Poitiers, France, April 11-13, 2005. Proceedingsm, volume 3434 of LNCS, page 213. Springer, Berlin Heidelberg New York, 2005
13. H. Bunke. Recent developments in graph matching. In ICPR 2000, pages 2117-2124, 2000
14. J.M. Jolion. Graph matching: What are we really talking about? In 3rd IAPR-TC15 workshop on Graph-based Representations in Pattern Recognition pages 170-175, 2001
15. S. Sorlin and C. Solnon. Reactive tabu search for measuring graph similarity. In L. Brun and M. Vento, editors, 5th IAPR-TC-15 workshop on Graph-based Representation in Pattern Recognition, Springer, Berlin Heidelberg New York, pages 172-182, 2005
16. S. Zampelli, Y. Deville, and P. Dupont. Approximate constrained subgraph matching. In 11th International Conference on Principles and Practice of Constraint Programming, number 3709 in LNCS, Springer, Berlin Heidelberg new York, pages 832-836, 2005
17. D. Lin. An Information-theoretic definition of similarity. In Proceedings of ICML 1998, 15th International Conference on Machine Learning, Morgan Kaufmann, Los Altos, CA, pages 296-304, 1998
18. A. Tversky. Features of Similarity. In Psychological Review, volume 84, American Psychological Association Inc., pages 327-352, 1977
19. H. Bunke and X. Jiang. Graph matching and similarity, In H.-N. Teodorescu, D. Mlynek, A. Kandel, and H.-J. Zimmermann, editors, Intelligent Systems and Interfaces, Chapter 1. Kluwer, Dordrecht, 2000
20. O. Sammoud, C. Solnon, and K. Ghdira. Ant algorithm for the graph matching problem. In 5th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005), volume 3448 of LNCS, Springer, Berlin Heidelberg New York, pages 213-223, April 2005
21. O. Sammoud, S. Sorlin, C. Solnon, and K. Ghdira. A comparative study of ant colony optimization and reactive search for graph matching problems. In 6th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006), volume to appear of LNCS Springer, Berlin Heidelberg New York, April 2006
22. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, MA, USA, 1974
23. J.E. Hopcroft and J.-K. Wong. Linear time algorithm for isomorphism of planar graphs. 6th Annual ACM Symposium on Theory of Computing, pages 172-184, 1974
24. E.M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer System Science, pages 42-65, 1982
25. F. Glover. Tabu search - part I. Journal on Computing, pages 190-260, 1989
26. S. Kirkpatrick, S. Gelatt, and M. Vecchi. Optimisation by simulated annealing. In Science, volume 220, pages 671-680, 1983
27. S. Petrovic, G. Kendall, and Y. Yang. A Tabu Search Approach for Graph-Structured Case Retrieval. In STAIRS 2002, pages 55-64, 2002
28. R. Battiti and M. Protasi. Reactive local search for the maximum clique problem. In Springer, editor, Algorithmica, volume 29, pages 610-637, 2001
29. M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw Hill, London, UK, pages 11-32, 1999
30. M. Dorigo and T. Stützle. Ant Colony Optimization. MIT, Cambridge, MA, 2004
31. B.D. McKay. Practical graph isomorphism. Congressus Numerantium, Nauty, 1981
32. L.P. Cordella, P. Foggia, and M. Vento C. Sansone. An improved algorithm for matching large graphs. 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, 2001
33. L.P. Cordella, P. Foggia, C. Sansone, and M. Vento. Performance evaluation of the vf graph matching algorithm. In Proceedings of the 10th International Conference on Image Analysis and Processing (ICIAP'99), IEEE, New York, page 1172, 1999