A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Error-tolerant graph matching: A formal framework and algorithms
[chapter]
1998
Lecture Notes in Computer Science
This paper first reviews some theoretical results in errortolerant graph matching that were obtained recently. The results include a new metric for error-tolerant graph matching based on maximum common subgraph, a relation between maximum common subgraph and graph edit distance, and the existence of classes of cost functions for error-tolerant graph matching. Then some new optimal algorithms for error-tolerant graph matching are discussed. Under specific conditions, the new algorithms may be
doi:10.1007/bfb0033223
fatcat:sfyjlcxnmjdmxhfhd25mg5rroa