The approximate graph matching problem

Author

Wang, Jason T L ; Zhang, Kaizhong ; Chirn, Gung-Wei

Author_Institution

Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

Volume

2

fYear

1994

fDate

9-13 Oct 1994

Firstpage

284

Abstract

Labeled graphs are graphs in which each node and edge has a label. The distance between two labeled graphs is considered to be the weighted sum of the costs of edit operations (insert, delete and relabel the nodes and edges) to transform one graph to the other. The paper considers two variants of the approximate graph matching (AGM) problem: given a pattern graph P and a data graph D, what is the distance between P and D? and what is the minimum distance between P and D when subgraphs can be freely removed from D? We show that no efficient algorithm can solve either variant of the AGM, unless P=NP. We then give a polynomial-time approximation algorithm to solve this problem

Keywords

pattern matching; approximate graph matching problem; computational complexity; labeled graphs; minimum distance; pattern matching; polynomial-time approximation; weighted sum; Approximation algorithms; Chemical compounds; Chemistry; Computational Intelligence Society; Costs; Pattern matching; Polynomials; Proteins; Sequences; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1994. Vol. 2 - Conference B: Computer Vision & Image Processing., Proceedings of the 12th IAPR International. Conference on

Conference_Location

Jerusalem

Print_ISBN

0-8186-6270-0

Type

conf

DOI

10.1109/ICPR.1994.576921

Filename

576921