Comparing Stars: On Approximating Graph Edit Distance

@article{Zeng2009ComparingSO,
  title={Comparing Stars: On Approximating Graph Edit Distance},
  author={Zhiping Zeng and Anthony K. H. Tung and Jianyong Wang and Jianhua Feng and Lizhu Zhou},
  journal={PVLDB},
  year={2009},
  volume={2},
  pages={25-36}
}
Graph data have become ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit distance is one of the most widely accepted measures to determine similarities between graphs and has extensive applications in the fields of pattern recognition, computer vision etc. Unfortunately, the problem of graph edit distance computation is NP-Hard in general. Accordingly, in this paper we introduce three novel methods to compute the upper and lower bounds for the… CONTINUE READING
Highly Influential
This paper has highly influenced 33 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 204 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 144 citations

205 Citations

02040'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 205 citations based on the available data.

See our FAQ for additional information.