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]
- Approximation of graph edit distance based on Hausdorff matchingAndreas Fischer, Ching Y. Suen, Volkmar Frinken, Kaspar Riesen, Horst Bunke. PR, 48(2):331-343, 2015. [doi]
- Edit Distance Based Kernel Functions for Attributed Graph MatchingMichel Neuhaus, Horst Bunke. gbrpr 2005: 352-361 [doi]