Error-Tolerant Graph Matching: A Formal Framework and Algorithms

  title={Error-Tolerant Graph Matching: A Formal Framework and Algorithms},
  author={H. Bunke},
  • H. Bunke
  • Published in SSPR/SPR 1998
  • Computer Science
  • This paper first reviews some theoretical results in error-tolerant 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… CONTINUE READING
    Error-tolerant graph matching using node contraction
    • 4
    Error-Tolerant Geometric Graph Similarity
    • 2
    Graph Matching : Theoretical Foundations , Algorithms , and Applications
    • 171
    • PDF
    Error-tolerant geometric graph similarity and matching
    • 1
    Recent developments in graph matching
    • 192
    • PDF
    On the use of similarity metrics for approximate graph matching
    • 5
    • Highly Influenced
    A Short Survey of Recent Advances in Graph Matching
    • 72
    • PDF


    Publications referenced by this paper.
    A graph distance metric based on the maximal common subgraph
    • 717
    • PDF
    Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
    • 263
    • PDF
    On a relation between graph edit distance and maximum common subgraph
    • H. Bunke
    • Mathematics, Computer Science
    • 1997
    • 530
    Efficient Graph Matching for Video Indexing
    • 23
    The approximate graph matching problem
    • 29
    An Algorithm for Subgraph Isomorphism
    • 2,048
    • PDF
    A note on the derivation of maximal common subgraphs of two directed or undirected graphs
    • 237
    Error-Correcting Graph Isomorphism Using Decision Trees
    • 28
    Subgraph Transformations for the Inexact Matching of Attributed Relational Graphs
    • 63