Median graphs: A genetic approach based on new theoretical properties

Pattern Recognition

Volumn 42, Issue 9, 2009, Pages 2003-2012

  Ferrer, M ^a   Valveny, E ^a   Serratosa, F ^b  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Genetic search; Graph matching; Maximum common subgraph; Median graph; Structural pattern recognition

Indexed keywords

GENETIC SEARCH; GRAPH MATCHING; MAXIMUM COMMON SUBGRAPH; MEDIAN GRAPH; STRUCTURAL PATTERN RECOGNITION;

COMPUTATIONAL COMPLEXITY; IMAGE CLASSIFICATION;

PATTERN MATCHING;

EID: 67349093251     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2009.01.034     Document Type: Article

References (35)

1. Auwatanamongkol S. Inexact graph matching using a genetic algorithm for image recognition. Pattern Recognition Letters 28 12 (2007) 1428-1437
2. Balas E., and Yu C.S. Finding a maximum clique in an arbitrary graph. SIAM Journal on Computing 15 4 (1986) 1054-1068
3. Bunke H. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18 8 (1997) 689-694
4. Bunke H., and Allerman G. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1 4 (1983) 245-253
5. H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, M. Vento, A comparison of algorithms for maximum common subgraph on randomly connected graphs, in: Structural, Syntactic, and Statistical Pattern Recognition, Proceedings of the Joint IAPR International Workshops SSPR 2002 and SPR 2002, Windsor, Ontario, Canada, August 6-9, 2002, Lecture Notes in Computer Science, vol. 2396, Springer, Berlin, 2002.
6. H. Bunke, P. Foggia, C. Guidobaldi, M. Vento, Graph clustering using the weighted minimum common supergraph, in: Graph Based Representations in Pattern Recognition, Proceedings of the 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30-July 2, 2003, Lecture Notes in Computer Science, vol. 2726, Springer, Berlin, 2003.
7. Bunke H., Jiang X., and Kandel A. On the minimum common supergraph of two graphs. Computing 65 1 (2000) 13-25
8. Bunke H., Münger A., and Jiang X. Combinatorial search versus genetic algorithms: a case study based on the generalized median graph problem. Pattern Recognition Letters 20 11-13 (1999) 1271-1277
9. Bunke H., and Shearer K. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19 3-4 (1998) 255-259
10. Conte D., Foggia P., and Vento M. Challenging complexity of maximum common subgraph detection algorithms: a performance analysis of three algorithms on a wide database of graphs. Journal of Graph Algorithms and Applications 11 1 (2007) 99-143
11. Cross A.D.J., Wilson R.C., and Hancock E.R. Inexact graph matching using genetic search. Pattern Recognition 30 6 (1997) 953-970
12. P.J. Durand, R. Pasari, J.W. Baker, C. che Tsai, An efficient algorithm for similarity analysis of molecules, Internet Journal of Chemistry 2 (17) (1999).
13. Fernández M.-L., and Valiente G. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters 22 6/7 (2001) 753-758
14. M. Ferrer, F. Serratosa, A. Sanfeliu, Synthesis of median spectral graph, in: J.S. Marques, N.P. de la Blanca, P. Pina (Eds.), IbPRIA (2), Lecture Notes in Computer Science, vol. 3523, Springer, Berlin, 2005.
15. M. Ferrer, F. Serratosa, E. Valveny, On the relation between the median and the maximum common subgraph of a set of graphs, in: Proceedings of the 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Lecture Notes in Computer Science, vol. 4538, Springer, Berlin, 2007.
16. M. Ferrer, E. Valveny, F. Serratosa, Spectral median graphs applied to graphical symbol recognition, in: J.F.M. Trinidad, J.A. Carrasco-Ochoa, J. Kittler (Eds.), CIARP, Lecture Notes in Computer Science, vol. 4225, Springer, Berlin, 2006.
17. M. Ferrer, E. Valveny, F. Serratosa, Bounding the size of the median graph, in: J. Martí, J.-M. Benedí, A.M. Mendonça, J. Serrat (Eds.), IbPRIA (2), Lecture Notes in Computer Science, vol. 4478, Springer, Berlin, 2007.
18. M. Ferrer, E. Valveny, F. Serratosa, Generalized median graph: a new optimal algorithm based on the maximum common subgraph, CVC Technical Report no. 109, 2007.
19. A. Hlaoui, S. Wang, A new median graph algorithm, in: Graph Based Representations in Pattern Recognition, Proceedings of the 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30-July 2, 2003, Lecture Notes in Computer Science, vol. 2726, Springer, Berlin, 2003.
20. Hlaoui A., and Wang S. Median graph computation for graph clustering. Soft Computing 10 1 (2006) 47-53
21. X. Jiang, A. Münger, H. Bunke, Synthesis of representative graphical symbols by computing generalized median graph, in: A.K. Chhabra, D. Dori (Eds.), GREC, Lecture Notes in Computer Science, vol. 1941, Springer, Berlin, 1999.
22. Jiang X., Münger A., and Bunke H. On median graphs: properties, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 10 (2001) 1144-1151
23. Jong K.A.D., and Spears W.M. Using genetic algorithms to solve NP-complete problems. In: Schaffer J.D. (Ed). ICGA (1989), Morgan Kaufmann
24. Kandel A., Bunke H., and Last M. Applied Graph Theory in Computer Vision and Pattern Recognition (Series in Computational Intelligence) (2007), Springer, Berlin
25. McGregor J.J. Backtrack search algorithms and the maximal common subgraph problem. Software-Practice and Experience 12 1 (1982) 23-24
26. Mitchel M. An Introduction to Genetic Algorithms (1996), MIT Press, Cambridge, MA
27. A. Münger, Synthesis of prototype graphs from sample graphs, Diploma Thesis, University of Bern, 1998 (in German).
28. M. Neuhaus, H. Bunke, A quadratic programming approach to the graph edit distance problem, in: Proceedings of the 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Lecture Notes in Computer Science, vol. 4538, Springer, Berlin, 2007.
29. M. Neuhaus, K. Riesen, H. Bunke, Fast suboptimal algorithms for the computation of graph edit distance, in: Structural, Syntactic, and Statistical Pattern Recognition, Proceedings of the Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006, Lecture Notes in Computer Science, vol. 4109, Springer, Berlin, 2006.
30. K. Riesen, M. Neuhaus, H. Bunke, Bipartite graph matching for computing the edit distance of graphs, in: Proceedings of the 6th IAPR-TC-15 International Workshop, GbRPR 2007, Alicante, Spain, June 11-13, 2007, Lecture Notes in Computer Science, vol. 4538, Springer, Berlin, 2007.
31. Sanfeliu A., and Fu K. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13 3 (1983) 353-362
32. A. Schenker, H. Bunke, M. Last, A. Kandel, Graph-theoretic techniques for web content mining, in: Series in Machine Perception and Artificial Intelligence, World Scientific, Singapore, River Edge, NJ, USA, 2005.
33. Y. Wang, C. Maple, A novel efficient algorithm for determining maximum common subgraphs, in: 9th International Conference on Information Visualisation, IV 2005, 6-8 July 2005, London, UK, IEEE Computer Soc. Press, Silver Spring, MD, 2005.
34. Wang Y.-K., Fan K.-C., and Horng J.-T. Genetic-based search for error-correcting graph isomorphism. IEEE Transactions on Systems, Man, and Cybernetics, Part B 27 4 (1997) 588-597
35. D. White, R.C. Wilson, Mixing spectral representations of graphs, in: 18th International Conference on Pattern Recognition (ICPR 2006), 20-24 August 2006, Hong Kong, China, IEEE Computer Soc. Press, Silver Spring, MD, 2006.