Fast Suboptimal Algorithms for the Computation of Graph Edit Distance

252 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Unsupervised Inductive Whole-Graph Embedding by Preserving Graph Proximity (2019, methodology): “We take the minimum distance computed by BEAM (Neuhaus et al., 2006), HUNGARIAN (Riesen & Bunke, 2009), and VJ (Fankhauser et al., 2011).”
Discriminative prototype selection methods for graph embedding (2013, methodology): “Among various methods [29,33–35], the bipartite approach proposed in [33] was chosen to compute the graph edit distance in this paper.”
An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems (2015, methodology): “Indeed, the exact algorithms dedicated to solving error-tolerant graph matching are computationally complex (Vento, 2015); and (M. Neuhaus and Bunke., 2006)).”
Approximate graph edit distance computation by means of bipartite graph matching (2009, methodology): “The first reference system is given by the optimal tree search algorithm (HEURISTIC-A*) described in Section 2, while the second reference system is a modification of HEURISTICA* [10].”