Approximate graph edit distance computation by means of bipartite graph matching
Citations
339 citations
Cites background from "Approximate graph edit distance com..."
...Last but not least, the search accuracy of this approach is ultimately bounded by the quality of bipartite graph matching [35]....
[...]
338 citations
325 citations
258 citations
236 citations
Cites methods from "Approximate graph edit distance com..."
...Fortunately, the well-known K-M algorithm for the GAP has been designed with the complexity of O(m(3))[7], [13], [17] and has been applied widely in industries [20], and its Java code is also available [4]....
[...]
...The K-M algorithm, when properly implemented, can operate with the computational complexity of O(m(3))[13], [17], [20], [23]....
[...]
References
34,239 citations
"Approximate graph edit distance com..." refers background in this paper
...This results in a training set of size 1200, a validation set of size 500, and a test set of size 1000....
[...]
11,096 citations
10,366 citations
"Approximate graph edit distance com..." refers background or methods or result in this paper
...Formally, for a node p in the search tree, we use gðpÞ to denote the cost of the optimal path from the root node to the current node p, i.e. gðpÞ is set equal to the cost of the partial edit path accumulated so far, and we use hðpÞ for denoting g2 e labels are represented by different shades of…...
[...]
...To find the most suitable edit path out of !ðg1; g2Þ, one introduces a cost for each edit operation, measuring the strength of the corresponding operation....
[...]
...The current paper has been significantly extended with respect to the underlying methodology and the experimental evaluation....
[...]
8,811 citations