作者: H. Bunke
DOI: 10.1007/BFB0033223
关键词:
摘要: This paper first reviews some theoretical results in error-tolerant graph matching that were obtained recently. The include a new metric for based on maximum common subgraph, relation between subgraph and edit distance, the existence of classes cost functions matching. Then optimal algorithms are discussed. Under specific conditions, may be significantly more efficient than traditional methods.