On a relation between graph edit distance and maximum common subgraph

Author: Bunke H.1

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

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

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

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A