Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Kaspar Riesen, Andreas Fischer, Horst Bunke. Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation. In Neamat El Gayar, Friedhelm Schwenker, Cheng Suen, editors, Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014. Proceedings. Volume 8774 of Lecture Notes in Computer Science, pages 117-128, Springer, 2014. [doi]

The following publications are possibly variants of this publication:

Bipartite Graph Matching for Computing the Edit Distance of GraphsKaspar Riesen, Michel Neuhaus, Horst Bunke. gbrpr 2007: 1-12 [doi]

Approximate graph edit distance computation by means of bipartite graph matchingKaspar Riesen, Horst Bunke. ivc, 27(7):950-959, 2009. [doi]

Speeding Up Graph Edit Distance Computation through Fast Bipartite MatchingStefan Fankhauser, Kaspar Riesen, Horst Bunke. gbrpr 2011: 102-111 [doi]

Speeding Up Graph Edit Distance Computation with a Bipartite HeuristicKaspar Riesen, Stefan Fankhauser, Horst Bunke. mlg 2007: [doi]

Edit Distance Based Kernel Functions for Attributed Graph MatchingMichel Neuhaus, Horst Bunke. gbrpr 2005: 352-361 [doi]

Self-Organizing Graph Graph Edit DistanceMichel Neuhaus, Horst Bunke. gbrpr 2003: 83-94 [doi]

Automatic learning of cost functions for graph edit distanceMichel Neuhaus, Horst Bunke. isci, 177(1):239-247, 2007. [doi]

Fast Suboptimal Algorithms for the Computation of Graph Edit DistanceMichel Neuhaus, Kaspar Riesen, Horst Bunke. gacm 2006: 163-172 [doi]

runs on WebDSL