On the Impact of Using Utilities Rather than Costs for Graph Matching

[1]  Benoit Gaüzère,et al.  Graph edit distance as a quadratic assignment problem , 2017, Pattern Recognit. Lett..

[2]  Kaspar Riesen,et al.  Approximation of Graph Edit Distance by Means of a Utility Matrix , 2016, ANNPR.

[3]  Kaspar Riesen,et al.  Greedy Graph Edit Distance , 2015, MLDM.

[4]  Kaspar Riesen,et al.  Approximation of Graph Edit Distance in Quadratic Time , 2015, GbRPR.

[5]  Andy King,et al.  Revisiting Volgenant-Jonker for Approximating Graph Edit Distance , 2015, GbRPR.

[6]  Francesc Serratosa,et al.  Learning graph-matching edit-costs based on the optimality of the oracle's node correspondences , 2015, Pattern Recognit. Lett..

[7]  Francesc Serratosa,et al.  Speeding up Fast Bipartite Graph Matching Through a New Cost Matrix , 2015, Int. J. Pattern Recognit. Artif. Intell..

[8]  Kaspar Riesen,et al.  Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time , 2014, ANNPR.

[9]  Friedhelm Schwenker,et al.  Proceedings of the 6th IAPR TC 3 International Workshop on Artificial Neural Networks in Pattern Recognition - Volume 8774 , 2014, ANNPR 2014.

[10]  Kaspar Riesen,et al.  Improving Graph Edit Distance Approximation by Centrality Measures , 2014, 2014 22nd International Conference on Pattern Recognition.

[11]  Kaspar Riesen,et al.  Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks , 2014, S+SSPR.

[12]  Yvon Savaria,et al.  A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance , 2014, S+SSPR.

[13]  Francisco Escolano,et al.  Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition - Volume 8621 , 2014 .

[14]  Francesc Serratosa,et al.  Fast computation of Bipartite graph matching , 2014, Pattern Recognit. Lett..

[15]  Mario Vento,et al.  Graph Matching and Learning in Pattern Recognition in the Last 10 Years , 2014, Int. J. Pattern Recognit. Artif. Intell..

[16]  Edwin R. Hancock,et al.  A Continuous-Time Quantum Walk Kernel for Unattributed Graphs , 2013, GbRPR.

[17]  Alberto Sanfeliu,et al.  On the Graph Edit Distance Cost: Properties and Applications , 2012, Int. J. Pattern Recognit. Artif. Intell..

[18]  Francesc Serratosa,et al.  Automatic Learning of Edit Costs Based on Interactive and Adaptive Graph Recognition , 2011, GbRPR.

[19]  Kaspar Riesen,et al.  Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching , 2011, GbRPR.

[20]  Benoit Gaüzère,et al.  Two New Graph Kernels and Applications to Chemoinformatics , 2011, GbRPR.

[21]  Kaspar Riesen,et al.  Graph Classification and Clustering Based on Vector Space Embedding , 2010, Series in Machine Perception and Artificial Intelligence.

[22]  Kaspar Riesen,et al.  Approximate graph edit distance computation by means of bipartite graph matching , 2009, Image Vis. Comput..

[23]  Kaspar Riesen,et al.  IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.

[24]  Karsten M. Borgwardt,et al.  Graph Kernels , 2008, J. Mach. Learn. Res..

[25]  Horst Bunke,et al.  Bridging the Gap between Graph Edit Distance and Kernel Machines , 2007, Series in Machine Perception and Artificial Intelligence.

[26]  Kaspar Riesen,et al.  Bipartite Graph Matching for Computing the Edit Distance of Graphs , 2007, GbRPR.

[27]  Kaspar Riesen,et al.  Fast Suboptimal Algorithms for the Computation of Graph Edit Distance , 2006, SSPR/SPR.

[28]  Alfred O. Hero,et al.  A binary linear programming formulation of the graph edit distance , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[29]  Horst Bunke,et al.  Self-organizing maps for learning the edit costs in graph matching , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[31]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[32]  H. Bunke,et al.  A probabilistic approach to learning costs for graph edit distance , 2004, Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004..

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

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

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

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

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

[38]  Ravindra K. Ahuja,et al.  The Scaling Network Simplex Algorithm , 1992, Oper. Res..

[39]  Eiichi Tanaka,et al.  The Tree-to-Tree Editing Problem , 1988, Int. J. Pattern Recognit. Artif. Intell..

[40]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

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

[42]  David Avis,et al.  A survey of heuristics for the weighted matching problem , 1983, Networks.

[43]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

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

[45]  V. Srinivasan,et al.  Cost operator algorithms for the transportation problem , 1977, Math. Program..

[46]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[47]  J. Munkres.  ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[48]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[49]  Kaspar Riesen,et al.  Structural Pattern Recognition with Graph Edit Distance , 2016, Advances in Computer Vision and Pattern Recognition.

[50]  Horst Bunke,et al.  Automatic learning of cost functions for graph edit distance , 2007, Inf. Sci..

[51]  Kaspar Riesen,et al.  Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic , 2007, MLG.

[52]  J. van Leeuwen,et al.  Graph Based Representations in Pattern Recognition , 2003, Lecture Notes in Computer Science.

[53]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[54]  Konstantinos Paparrizos,et al.  A Dual Forest Algorithm for the Assignment Problem , 1990, Applied Geometry And Discrete Mathematics.

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

[56]  J. Orlin.  On the simplex algorithm for networks and generalized networks , 1983 .

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

[58]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[59]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[60]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .