Thirty Years Of Graph Matching In Pattern Recognition

A recent paper posed the question: "Graph Matching: What are we really talking about?". Far from providing a definite answer to that question, in this paper we will try to characterize the role that graphs play within the Pattern Recognition field. To this aim two taxonomies are presented and discussed. The first includes almost all the graph matching algorithms proposed from the late seventies, and describes the different classes of algorithms. The second taxonomy considers the types of common applications of graph-based techniques in the Pattern Recognition and Machine Vision field.

[1]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[2]  Martin A. Fischler,et al.  The Representation and Matching of Pictorial Structures , 1973, IEEE Transactions on Computers.

[3]  Coenraad Bron,et al.  Finding all cliques of an undirected graph , 1973 .

[4]  Harry G. Barrow,et al.  A Versatile Computer-Controlled Assembly System , 1973, IJCAI.

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

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

[8]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[10]  L. Kitchen.  Discrete Relaxation for Matching Relational Structures , 1978 .

[11]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Andrew K. C. Wong,et al.  Graph Optimal Monomorphism Algorithms , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[13]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[14]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[16]  King-Sun Fu,et al.  Subgraph error-correcting isomorphisms for syntactic pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[17]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  King-Sun Fu,et al.  A graph distance measure for image analysis , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Robert M. Haralick,et al.  A Metric for Comparing Relational Descriptions , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  King-Sun Fu,et al.  An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[22]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Josef Kittler,et al.  Combining Evidence in Probabilistic Relaxation , 1989, Int. J. Pattern Recognit. Artif. Intell..

[24]  Ling-Hwei Chen,et al.  Handwritten character recognition using a 2-layer random graph model by relaxation matching , 1990, Pattern Recognit..

[25]  William Grimson,et al.  Object recognition by computer - the role of geometric constraints , 1991 .

[26]  Andrew K. C. Wong,et al.  An algorithm for graph optimal monomorphism , 1990, IEEE Trans. Syst. Man Cybern..

[27]  Ching Y. Suen,et al.  Hierarchical attributed graph representation and recognition of handwritten chinese characters , 1991, Pattern Recognit..

[28]  Jan J. Gerbrands,et al.  Consistent inexact graph matching applied to labelling coronary segments in arteriograms , 1992, Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. III. Conference C: Image, Speech and Signal Analysis,.

[29]  Theodosios Pavlidis,et al.  A shape analysis model with applications to a character recognition system , 1992, [1992] Proceedings IEEE Workshop on Applications of Computer Vision.

[30]  Salih O. Duffuaa,et al.  A Linear Programming Approach for the Weighted Graph Matching Problem , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[31]  Joachim M. Buhmann,et al.  Distortion Invariant Object Recognition in the Dynamic Link Architecture , 1993, IEEE Trans. Computers.

[32]  Michel Gendreau,et al.  Solving the maximum clique problem using a tabu search approach , 1993, Ann. Oper. Res..

[33]  Kyu Ho Park,et al.  Incremental clustering of attributed graphs , 1993, IEEE Trans. Syst. Man Cybern..

[34]  Kaizhong Zhang,et al.  The approximate graph matching problem , 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 3 - Conference C: Signal Processing (Cat. No.94CH3440-5).

[35]  Kaizhong Zhang,et al.  Exact and approximate algorithms for unordered tree matching , 1994, IEEE Trans. Syst. Man Cybern..

[36]  Keiichi Abe,et al.  Region correspondence by inexact attributed planar graph matching , 1995, Proceedings of IEEE International Conference on Computer Vision.

[37]  Kuo-Chin Fan,et al.  Solving weighted graph matching problem by modified microgenetic algorithm , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[38]  Theodosios Pavlidis,et al.  Matching graph embeddings for shape analysis , 1995, Proceedings of 3rd International Conference on Document Analysis and Recognition.

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

[40]  Alexander Filatov,et al.  Graph-based handwritten digit string recognition , 1995, Proceedings of 3rd International Conference on Document Analysis and Recognition.

[41]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[42]  Ai-Jia Hsieh,et al.  Bipartite weighted matching for on-line handwritten Chinese character recognition , 1995, Pattern Recognit..

[43]  Eam Khwang Teoh,et al.  Self-organizing Hopfield network for attributed relational graph matching , 1995, Image Vis. Comput..

[44]  Eam Khwang Teoh,et al.  Pattern recognition by graph matching using the Potts MFT neural networks , 1995, Pattern Recognit..

[45]  Mario Vento,et al.  An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[46]  Eric Mjolsness,et al.  A Lagrangian relaxation network for graph matching , 1996, IEEE Trans. Neural Networks.

[47]  A. Shoukry,et al.  Neural network approach for solving the maximal common subgraph problem , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[48]  Dario Maio,et al.  A structural approach to fingerprint classification , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[49]  Kwok-Ping Chan.  Learning templates from fuzzy examples in structural pattern recognition , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[50]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[51]  A. Jagota,et al.  Feasible and infeasible maxima in a quadratic program for maximum clique , 1996 .

[52]  Mohan M. Trivedi,et al.  Graph matching using a direct classification of node attendance , 1996, Pattern Recognit..

[53]  Sheun Olatunbosun,et al.  Topological representation for matching coloured surfaces , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[54]  M. Pelillo.  Relaxation labeling networks for the maximum clique problem , 1996 .

[55]  Rama Chellappa,et al.  Target indexing in synthetic aperture radar imagery using topographic features , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[56]  Jaime López-Krahe,et al.  Hand drawn document understanding using the straight line Hough transform and graph matching , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[57]  Armin B. Cremers,et al.  Recognition of Polymorphic Patterns in Parameterized Graphs for 3D Building Reconstruction , 1997, GbRPR.

[58]  Horst Bunke,et al.  Recent Advances in Graph Matching , 1997, Int. J. Pattern Recognit. Artif. Intell..

[59]  S. Tanimoto,et al.  A parallel algorithm for graph matching and its MasPar implementation , 1997, 1993 Computer Architectures for Machine Perception.

[60]  Kuo-Chin Fan,et al.  Genetic-based search for error-correcting graph isomorphism , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[61]  In Kyu Park In Kyu Park,et al.  Models and algorithms for efficient color image indexing , 1997, 1997 Proceedings IEEE Workshop on Content-Based Access of Image and Video Libraries.

[62]  Norbert Krüger,et al.  Face recognition by elastic bunch graph matching , 1997, Proceedings of International Conference on Image Processing.

[63]  Edwin R. Hancock,et al.  Graph Matching with Hierarchical Discrete Relaxation , 1997, NIPS.

[64]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[65]  W. Kantor,et al.  Groups and Computation II , 1997 .

[66]  Ch. Demko.  Generalization of Two Hypergraphs. Algorithm of Calculation of the Greatest Sub-Hypergraph Common to Two Hypergraphs Annotated by Semantic Information , 1997, GbRPR.

[67]  Immanuel M. Bomze,et al.  Evolution towards the Maximum Clique , 1997, J. Glob. Optim..

[68]  Kemal Oflazer.  Error-Tolerant Retrieval of Trees , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[69]  Euripides G. M. Petrakis,et al.  Similarity Searching in Medical Image Databases , 1997, IEEE Trans. Knowl. Data Eng..

[70]  Laurenz Wiskott,et al.  Phantom faces for face analysis , 1997, Proceedings of International Conference on Image Processing.

[71]  Mario Vento,et al.  Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs , 1997, GbRPR.

[72]  Horst Bunke,et al.  Efficient Graph Matching for Video Indexing , 1997, GbRPR.

[73]  Horst Bunke,et al.  On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..

[74]  Panos M. Pardalos,et al.  An Exact Parallel Algorithm for the Maximum Clique Problem , 1998 .

[75]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[76]  Kuo-Chin Fan,et al.  A fuzzy bipartite weighted graph matching approach to fingerprint verification , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[77]  Kaleem Siddiqi,et al.  Matching Hierarchical Structures Using Association Graphs , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[78]  Suk I. Yoo,et al.  Image retrieval using topological structure of user sketch , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[79]  Benoit Huet,et al.  Fuzzy relational distance for large-scale object recognition , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[80]  Suk I. Yoo,et al.  A structural matching for two-dimensional visual pattern inspection , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[81]  Mario Vento,et al.  Graph matching: a fast algorithm and its evaluation , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[82]  Hartmut Neven,et al.  Automatic pose estimation system for human faces based on bunch graph matching technology , 1998, Proceedings Third IEEE International Conference on Automatic Face and Gesture Recognition.

[83]  Horst Bunke,et al.  A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[84]  Hong Yan,et al.  Recognition of handprinted Chinese characters by constrained graph matching , 1998, Image Vis. Comput..

[85]  Marcello Pelillo,et al.  A unifying framework for relational structure matching , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[86]  Benjamin B. Kimia,et al.  Symmetry-Based Indexing of Image Databases , 1998, J. Vis. Commun. Image Represent..

[87]  Horst Bunke,et al.  Marked Subgraph Isomorphism of Ordered Graphs , 1998, SSPR/SPR.

[88]  Mohamed A. Ismail,et al.  A new algorithm for subgraph optimal isomorphism , 1998, Pattern Recognit..

[89]  Yuji Shinano,et al.  Solving the maximum clique problem using PUBB , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[90]  Masahiko Yachida,et al.  Expression recognition from time-sequential facial images by use of expression change model , 1997, Proceedings Third IEEE International Conference on Automatic Face and Gesture Recognition.

[91]  Keiichi Abe,et al.  Automatic generation of prototypes in 3D structural object recognition , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[92]  Ettore Stella,et al.  Feature matching by searching maximum clique on high order association graph , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[93]  Michael J. Lyons,et al.  Automatic Classification of Single Facial Images , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[94]  Benoit Huet,et al.  Shape recognition from large image libraries by inexact graph matching , 1999, Pattern Recognit. Lett..

[95]  Edwin R. Hancock,et al.  Deterministic search for relational graph matching , 1999, Pattern Recognit..

[96]  R. Krishnapuram,et al.  A fuzzy approach to content-based image retrieval , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[97]  Marcello Pelillo,et al.  Replicator Equations, Maximal Cliques, and Graph Isomorphism , 1998, Neural Computation.

[98]  Horst Bunke,et al.  Error Correcting Graph Matching: On the Influence of the Underlying Cost Function , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[99]  Kostas Haris,et al.  Model-based morphological segmentation and labeling of coronary angiograms , 1999, IEEE Transactions on Medical Imaging.

[100]  Hong Yan,et al.  Graphic matching based on constrained Voronoi diagrams , 1999, ISSPA '99. Proceedings of the Fifth International Symposium on Signal Processing and its Applications (IEEE Cat. No.99EX359).

[101]  Mario Vento,et al.  Definition and Validation of a Distance Measure Between Structural Primitives , 1999, Pattern Analysis & Applications.

[102]  James Nga-Kwok Liu,et al.  An oscillatory elastic graph matching model for recognition of offline handwritten Chinese characters , 1999, 1999 Third International Conference on Knowledge-Based Intelligent Information Engineering Systems. Proceedings (Cat. No.99TH8410).

[103]  Horst Bunke,et al.  A decision tree approach to graph and subgraph isomorphism detection , 1999, Pattern Recognit..

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

[105]  Stefan Fischer,et al.  Face authentication with Gabor information on deformable graphs , 1999, IEEE Trans. Image Process..

[106]  Edwin R. Hancock,et al.  Bayesian graph edit distance , 1999, Proceedings 10th International Conference on Image Analysis and Processing.

[107]  P. Suganthan.  Attributed relational graph matching by neural-gas networks , 2000, Neural Networks for Signal Processing X. Proceedings of the 2000 IEEE Signal Processing Society Workshop (Cat. No.00TH8501).

[108]  Yang Bing,et al.  Online hand-sketched graphics recognition based on attributed relational graph matching , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[109]  Ricardo Baeza-Yates,et al.  An image similarity measure based on graph matching , 2000, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000.

[110]  Thomas S. Huang,et al.  Learning patterns from images by combining soft decisions and hard decisions , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[111]  Wilhelm Burger,et al.  Ear biometrics in computer vision , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[112]  Svetha Venkatesh,et al.  Graph Matching: Fast Candidate Elimination Using Machine Learning Techniques , 2000, SSPR/SPR.

[113]  Hanan Samet,et al.  Processing pictorial queries with multiple instances using isomorphic subgraphs , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[114]  Wen-Jing Li,et al.  Object recognition by sub-scene graph matching , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[115]  Anastasios Tefas,et al.  Frontal face authentication using morphological elastic graph matching , 2000, IEEE Trans. Image Process..

[116]  P. Foggia,et al.  Fast graph matching for detecting CAD image components , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[117]  Marcello Pelillo,et al.  A new deterministic annealing algorithm for maximum clique , 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium.

[118]  Hervé Le Men,et al.  Efficient Subgraph Isomorphism with 'A Priori' Knowledge (Application to 3D Reconstruction of Buildings for Cartography) , 2000, SSPR/SPR.

[119]  Horst Bunke,et al.  Efficient Subgraph Isomorphism Detection: A Decomposition Approach , 2000, IEEE Trans. Knowl. Data Eng..

[120]  Alberto Del Bimbo,et al.  A look-ahead strategy for graph matching in retrieval by spatial arrangement , 2000, 2000 IEEE International Conference on Multimedia and Expo. ICME2000. Proceedings. Latest Advances in the Fast Changing World of Multimedia (Cat. No.00TH8532).

[121]  Alberto Del Bimbo,et al.  The computational aspect of retrieval by spatial arrangement , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[122]  Jianzhuang Liu,et al.  Two-layer assignment method for online Chinese character recognition , 2000 .

[123]  Alberto Sanfeliu,et al.  Efficient algorithms for matching attributed graphs and function-described graphs , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[124]  Serge J. Belongie,et al.  Matching with shape contexts , 2000, 2000 Proceedings Workshop on Content-based Access of Image and Video Libraries.

[125]  Ali Shokoufandeh,et al.  A Unified Framework for Indexing and Matching Hierarchical Shape Structures , 2001, IWVF.

[126]  Lei Xu,et al.  A PCA approach for fast retrieval of structural patterns in attributed graphs , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[127]  Alberto Del Bimbo,et al.  Efficient Matching and Indexing of Graph Models in Content-Based Retrieval , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[128]  Swarup Medasani,et al.  Graph matching by relaxation of fuzzy assignments , 2001, IEEE Trans. Fuzzy Syst..

[129]  Ina Koch,et al.  Enumerating all connected maximal common subgraphs in two graphs , 2001, Theor. Comput. Sci..

[130]  Mario Vento,et al.  Symbolic vs. Connectionist Learning: An Experimental Comparison in a Structured Domain , 2001, IEEE Trans. Knowl. Data Eng..

[131]  Marcel J. T. Reinders,et al.  Facial landmarks localization based on fuzzy and Gabor wavelet graph matching , 2001, 10th IEEE International Conference on Fuzzy Systems. (Cat. No.01CH37297).

[132]  Bernard Mérialdo,et al.  Relational skeletons for retrieval in patent drawings , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[133]  Svetha Venkatesh,et al.  Video indexing and similarity retrieval by largest common subgraph detection using decision trees , 2001, Pattern Recognit..

[134]  Jochen Triesch,et al.  A System for Person-Independent Hand Posture Recognition against Complex Backgrounds , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[135]  Anastasios Tefas,et al.  Using Support Vector Machines to Enhance the Performance of Elastic Graph Matching for Frontal Face Authentication , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[136]  Edwin R. Hancock,et al.  Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[137]  Miro Kraetzl,et al.  Graph distances using graph union , 2001, Pattern Recognit. Lett..

[138]  C. Bauckhage,et al.  3D Assembly Recognition by Matching Functional Subparts , 2001 .

[139]  Josep Lladós,et al.  Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[140]  Svetha Venkatesh,et al.  Video sequence matching via decision tree path following , 2001, Pattern Recognit. Lett..

[141]  Hwann-Tzong Chen,et al.  Multi-object tracking using dynamical graph matching , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[142]  Edwin R. Hancock,et al.  Weighted Graph-Matching Using Modal Clusters , 2001, CAIP.

[143]  K. G. Khoo,et al.  Multiple relational graphs mapping using genetic algorithms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[144]  Mario Vento,et al.  A Performance Comparison of Five Algorithms for Graph Isomorphism , 2001 .

[145]  Andrea Torsello,et al.  Clustering shock trees , 2001 .

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

[147]  Gabriel Valiente,et al.  An efficient bottom-up distance between trees , 2001, Proceedings Eighth Symposium on String Processing and Information Retrieval.

[148]  Gabriel Valiente,et al.  A graph distance metric combining maximum common subgraph and minimum common supergraph , 2001, Pattern Recognit. Lett..

[149]  Barend J. van Wyk,et al.  Successive Projection Graph Matching , 2002, SSPR/SPR.

[150]  Edwin R. Hancock,et al.  Learning Structural Variations in Shock Trees , 2002, SSPR/SPR.

[151]  Barend J. van Wyk,et al.  Non-bayesian Graph Matching without Explicit Compatibility Calculations , 2002, SSPR/SPR.

[152]  Tariq S. Durrani,et al.  A RKHS Interpolator-Based Graph Matching Algorithm , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[153]  Ali N. Akansu,et al.  A Graph-Based Object Description for Information Retrieval in Digital Image and Video Libraries , 2002, J. Vis. Commun. Image Represent..

[154]  Javier Larrosa,et al.  Constraint satisfaction algorithms for graph pattern matching , 2002, Mathematical Structures in Computer Science.

[155]  T. Caelli,et al.  Inexact Multisubgraph Matching Using Graph Eigenspace and Clustering Models , 2002, SSPR/SPR.

[156]  Shengrui Wang,et al.  A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval , 2002, SSPR/SPR.

[157]  Horst Bunke,et al.  Identification of Diatoms by Grid Graph Matching , 2002, SSPR/SPR.

[158]  Marcello Pelillo,et al.  Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[159]  Josef Kittler,et al.  Using Graph Search Techniques for Contextual Colour Retrieval , 2002, SSPR/SPR.

[160]  Horst Bunke,et al.  A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs , 2002, SSPR/SPR.

[161]  Edwin R. Hancock,et al.  Computing approximate tree edit distance using relaxation labeling , 2003, Pattern Recognit. Lett..

[162]  Mario Vento,et al.  A large database of graphs and its use for benchmarking graph isomorphism algorithms , 2003, Pattern Recognit. Lett..

[163]  Wolfgang Bibel.  An approach to a systematic theorem proving procedure in first-order logic , 2005, Computing.

[164]  Charles A. Micchelli.  Characterization of Chebyshev approximation by weak Markoff systems , 2005, Computing.