Error-Tolerant Graph Matching: A Formal Framework and Algorithms

@inproceedings{Bunke1998ErrorTolerantGM,
  title={Error-Tolerant Graph Matching: A Formal Framework and Algorithms},
  author={Horst Bunke},
  booktitle={SSPR/SPR},
  year={1998}
}
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… CONTINUE READING
Highly Cited
This paper has 47 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Efficient graph matching algorithms for preprocessed model graphs

  • B. T. Messmer
  • PhD thesis, University of Bern, Switzerland,
  • 1995
Highly Influential
4 Excerpts

Indexing and retrieval of video using spatial reasoning techniques

  • K.1K. Shearer
  • PhD thesis, Curtin University of Technology…
  • 1998
Highly Influential
4 Excerpts

A biologically plausible model for corner-based object recognition from color images

  • T. Lourens
  • PhD thesis,
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…