Problem Solving of graph correspondenceusing Genetics Algorithm and ACO Algorithm

In this paper, new genetics and Ant colony optimization algorithm for solving the problem of graph correspondence is presented. When using the genetics technique for the problem of graph correspondence, it is not easy to define the crossover operator. our attempt will be to present a definition holding the integration of the population graph in a one-to-one correspondence. we present new and suitable definitions for the target function and a function giving score to a solution at the end of any cycle. We compare both algorithms and try to find their advantages and their shortcomings.

[1]  Christine Solnon,et al.  Ant Algorithm for the Graph Matching Problem , 2005, EvoCOP.

[2]  Pierre-Antoine Champin,et al.  Measuring the Similarity of Labeled Graphs , 2003, ICCBR.

[3]  Mario Vento,et al.  An Improved Algorithm for Matching Large Graphs , 2001 .

[4]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[5]  Mario Vento,et al.  A Database of Graphs for Isomorphism and Sub-Graph Isomorphism Benchmarking , 2001 .

[6]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[7]  Christine Solnon,et al.  A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems , 2006, EvoCOP.

[8]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

[9]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[10]  Takunari Miyazaki,et al.  The complexity of McKay's canonical labeling algorithm , 1995, Groups and Computation.

[11]  Christine Solnon,et al.  Reactive Tabu Search for Measuring Graph Similarity , 2005, GbRPR.

[12]  Horst Bunke,et al.  Graph matching and similarity , 2000 .

[13]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[14]  Horst Bunke,et al.  Efficient Attributed Graph Matching and Its Application to Image Analysis , 1995, ICIAP.

[15]  Celso C. Ribeiro,et al.  A Randomized Heuristic for Scene Recognition by Graph Matching , 2004, WEA.

[16]  Erkki Oja,et al.  Comparisons of attributed graph matching algorithms for computer vision , 1990 .

[17]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[18]  Bjørnar Tessem.  Genetic algorithms for analogical mapping , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[19]  P. Foggia,et al.  Performance evaluation of the VF graph matching algorithm , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[20]  Horst Bunke,et al.  Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Idenfication , 2003, GbRPR.

[21]  Horst Bunke,et al.  Advances In Structural And Syntactic Pattern Recognition , 1993 .

[22]  Horst Bunke,et al.  Including Geometry in Graph Representations: A Quadratic-Time Graph Isomorphism Algorithm and Its Application , 1996, SSPR.

[23]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..