Skip to main content
Article thumbnail
Location of Repository

EXACT AND INEXACT GRAPH MATCHING: METHODOLOGY AND APPLICATIONS

By Kaspar Riesen, Xiaoyi Jiang and Horst Bunke

Abstract

Graphs provide us with a powerful and flexible representation formalism which can be employed in various fields of intelligent information processing. The process of evaluating the similarity of graphs is referred to as graph matching. Two approaches to this task exist, viz. exact and inexact graph matching. The former approach aims at finding a strict correspondence between two graphs to be matched, while the latter is able to cope with errors and measures the difference of two graphs in a broader sense. The present chapter reviews some fundamental concepts of both paradigms and shows two recent applications of graph matching in the fields of information retrieval and pattern recognition.

Topics: C.C. Aggarwal and H. Wang (eds
Publisher: 2013-11-22
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.4835
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://link.springer.com/conte... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.