On a relation between graph edit distance and maximum common subgraph

Author: Bunke H.¹

Source: Pattern Recognition Letters, Volume 18, Number 8, August 1997 , pp. 689-694(6)

Publisher: Elsevier

Keywords: Approximate graph matching; Graph edit distance; Maximum common subgraph; Edit operation; Cost function

Language: English

Document Type: Research article

DOI: 10.1016/S0167-8655(97)00060-3

Affiliations: 1: Institut fur Informatik und angewandte Mathematik, University of Bern, Neubruckstr. 10, CH-3012 Bern, Switzerland

Links for this article

http://www.ingentaconnect.com/els/01678655/1997/00000018/00000008/art00060
http://openurl.ingenta.com/content?genre=article&issn=0167-8655&volume=18&issue=8&spage=689&epage=694
http://dx.doi.org/10.1016/S0167-8655(97)00060-3