Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation

Lijun Chang, Xing Feng, Xuemin Lin +2

Graph edit distance (GED) is an important similarity measure adopted in a similarity-based analysis between two graphs, and computing GED is a primitive operator in graph database…