Median graph: A new exact algorithm using a distance based on the maximum common subgraph

Pattern Recognition Letters

Volumn 30, Issue 5, 2009, Pages 579-588

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

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Graph matching; Maximum common subgraph; Median graph; Minimum common supergraph

Indexed keywords

ALGORITHMS; IMAGE CLASSIFICATION; PROBABILITY DENSITY FUNCTION;

APPROXIMATE ALGORITHMS; BACKTRACKING ALGORITHMS; DISTANCE-BASED; EXACT ALGORITHMS; EXACT SOLUTIONS; GENETIC SEARCHES; GRAPH MATCHING; GRAPH-EDIT DISTANCES; HARD PROBLEMS; MAXIMUM COMMON SUBGRAPH; MEDIAN GRAPH; MINIMUM COMMON SUPERGRAPH; OPTIMAL ALGORITHMS; OPTIMAL SOLUTIONS; PREDICTION FUNCTIONS; REAL PROBLEMS; SEARCH SPACES; SYNTHETIC DATUM;

PATTERN MATCHING;

EID: 60249095247     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2008.12.014     Document Type: Article

References (27)

1. Balas E., and Yu C.S. Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15 4 (1986) 1054-1068
2. Bunke H. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett. 18 8 (1997) 689-694
3. Bunke H., and Allerman G. Inexact graph matching for structural pattern recognition. Pattern Recognition Lett. 1 4 (1983) 245-253
4. Bunke H., and Kandel A. Mean and maximum common subgraph of two graphs. Pattern Recognition Lett. 21 2 (2000) 163-168
5. 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 Lett. 20 11-13 (1999) 1271-1277
6. Bunke H., Jiang X., and Kandel A. On the minimum common supergraph of two graphs. Computing 65 1 (2000) 13-25
7. Bunke, H., Foggia, P., Guidobaldi, C., Sansone, C., Vento, M., 2002. A comparison of algorithms for maximum common subgraph on randomly connected graphs. In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR Internat. Workshops SSPR 2002 and SPR 2002, Proc., Windsor, Ontario, Canada, August 6-9, 2002. Lecture Notes in Computer Science, vol. 2396.
8. Bunke, H., Foggia, P., Guidobaldi, C., Vento, M., 2003. Graph clustering using the weighted minimum common supergraph. In: Graph Based Representations in Pattern Recognition, 4th IAPR Internat. Workshop, GbRPR 2003, Proc., York, UK, June 30-July 2, 2003. Lecture Notes in Computer Science, vol. 2726.
9. 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. J. Graph Algorithms Appl. 11 1 (2007) 99-143
10. Development Therapeutics Program, DTP, 2004. AIDS Antiviral Screen. .
11. Durand, P.J., Pasari, R., Baker, J.W., Tsai, C.C., 1999. An efficient algorithm for similarity analysis of molecules. Internet J. Chem. 2 (17).
12. Ferrer M., Serratosa F., and Sanfeliu A. Synthesis of median spectral graph. In: Marques J.S., de la Blanca N.P., and Pina P. (Eds). IbPRIA (2). Lecture Notes in Computer Science vol. 3523 (2005), Springer
13. Ferrer, M., Serratosa, F., Valveny, E., 2007a. On the relation between the median and the maximum common subgraph of a set of graphs. In: Escolano, F., Vento, M. (Eds.), Graph-Based Representations in Pattern Recognition, 6th IAPR-TC-15 Internat. Workshop, GbRPR 2007, Proc., Alicante, Spain, June 11-13, 2007. Lecture Notes in Computer Science, vol. 4538. Springer.
14. Ferrer M., Valveny E., and Serratosa F. Bounding the size of the median graph. In: Martí J., Benedí J.-M., Mendonça A.M., and Serrat J. (Eds). IbPRIA (2). Lecture Notes in Computer Science vol. 4478 (2007), Springer
15. Hlaoui A., and Wang S. Median graph computation for graph clustering. Soft Comput. 10 1 (2006) 47-53
16. Jiang X., Münger A., and Bunke H. On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Machine Intell. 23 10 (2001) 1144-1151
17. Justice D., and Hero A.O. A binary linear programming formulation of the graph edit distance. IEEE Trans. Pattern Anal. Machine Intell. 28 8 (2006) 1200-1214
18. Lu S.W., Ren Y., and Suen C.Y. Hierarchical attributed graph representation and recognition of handwritten chinese characters. Pattern Recognition 24 7 (1991) 617-632
19. McGregor J.J. Backtrack search algorithms and the maximal common subgraph problem. Software Pract. Exper. 12 1 (1982) 23-24
20. Münger, A., 1998. Synthesis of prototype graphs from sample graphs. Diploma Thesis, University of Bern (in German).
21. Neuhaus, M., Riesen, K., Bunke, H., 2006. Fast suboptimal algorithms for the computation of graph edit distance. In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR Internat. Workshops, SSPR 2006 and SPR 2006, Proc., Hong Kong, China, August 17-19, 2006. Lecture Notes in Computer Science, vol. 4109.
22. Pearce A.R., Caelli T.M., and Bischof W.F. Rulegraphs for graph matching in pattern recognition. Pattern Recognition 27 9 (1994) 1231-1247
23. Robles-Kelly A., and Hancock E.R. Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Machine Intell. 27 3 (2005) 365-378
24. Sanfeliu A., and Fu K. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Systems Man Cybernet. 13 3 (1983) 353-362
25. Wang Y., and Maple C. A novel efficient algorithm for determining maximum common subgraphs. Proc. 9th Internat. Conf. on Information Visualisation, IV 2005, July 6-8, 2005 (2005), IEEE Computer Society, London, UK
26. White D., and Wilson R.C. Mixing spectral representations of graphs. Proc. 18th Internat. Conf. on Pattern Recognition (ICPR 2006), August 20-24, 2006 (2006), IEEE Computer Society, Hong Kong, China
27. Wong E.K. Model matching in robot vision by subgraph isomorphism. Pattern Recognition 25 3 (1992) 287-303