DMCA
A Graph Distance Metric Based on the Maximal Common Subgraph (1998)
| Citations: | 174 - 13 self |
BibTeX
@MISC{Bunke98agraph,
author = {Horst Bunke and Kim Shearer},
title = {A Graph Distance Metric Based on the Maximal Common Subgraph},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Error-tolerant graph matching is a powerful concept that has various applications in pattern recognition and machine vision. In the present paper, a new distance measure on graphs is proposed. It is based on the maximal common subgraph of two graphs. The new measure is superior to edit distance based measures in that no particular edit operations together with their costs need to be defined. It is formally shown that the new distance measure is a metric. Potential algorithms for the efficient computation of the new measure are discussed. q 1998 Elsevier Science B.V. All rights reserved. Keywords: Error-tolerant graph matching; Distance measure; Maximal common subgraph; Graph edit distance; Metric 1. Introduction One of the most general and powerful data structures useful in a variety of applications are graphs. For example, in computer vision and pattern recognition, graphs are often used to represent unknown objects, which are to be recognized, and known models, which are stored in...
Keyphrases
maximal common subgraph graph distance metric pattern recognition new measure new distance measure error-tolerant graph matching unknown object machine vision elsevier science b.v. right distance measure present paper computer vision powerful data structure known model efficient computation powerful concept particular edit operation various application potential algorithm
