1998 AGraphDistMetricBasedOnTheMaxCommSub
Jump to navigation
Jump to search
- (Bunke & Shearer, 1998) ⇒ Horst Bunke, and Kim Shearer. (1998). “A Graph Distance Metric Based on the Maximal Common Subgraph.” In: Pattern Recognition Letters, 19(3-4). doi:10.1016/S0167-8655(97)00179-7
Subject Headings: Graph Edit Distance Function, Maximum Common Subgraph Task.
Notes
- See: (Bunke, 1997) ⇒ Horst Bunke. (1997). “On a Relation Between Graph Edit Distance and Maximum Common Subgraph.” In: Pattern Recognition Letters, 18(9).
Cited By
Quotes
Author Keywords
Error-tolerant graph matching; Distance measure; Maximal common subgraph; Graph edit distance; Metric
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.,
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 1998 AGraphDistMetricBasedOnTheMaxCommSub | Horst Bunke Kim Shearer | A Graph Distance Metric Based on the Maximal Common Subgraph | http://dx.doi.org/10.1016/S0167-8655(97)00179-7 | 10.1016/S0167-8655(97)00179-7 |