Fast Suboptimal Algorithms for the Computation of Graph Edit Distance

@inproceedings{Neuhaus2006FastSA,
  title={Fast Suboptimal Algorithms for the Computation of Graph Edit Distance},
  author={Michel Neuhaus and Kaspar Riesen and Horst Bunke},
  booktitle={SSPR/SPR},
  year={2006}
}
Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs and can be tailored to a wide variety of applications by means of specific edit cost functions. Its computational complexity, however, is exponential in the number of vertices, which means that edit distance is feasible for small graphs only. In this paper, we propose two simple, but effective modifications of a… CONTINUE READING
Highly Cited
This paper has 168 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 86 extracted citations

169 Citations

01020'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 169 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…