most citedCombinatorial Learning of Graph Edit Distance via Dynamic Embedding

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LG2020★ 1 cited

Combinatorial Learning of Graph Edit Distance via Dynamic Embedding

Runzhong Wang, Tianqi Zhang, Tianshu Yu +2

Graph Edit Distance (GED) is a popular similarity measurement for pairwise graphs and it also refers to the recovery of the edit path from the source graph to the target graph. Tra…