White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

RASCAL: calculation of graph similarity using maximum common edge subgraphs

Raymond, J.W., Gardiner, E.J. and Willett, P. (2002) RASCAL: calculation of graph similarity using maximum common edge subgraphs. The Computer Journal, 45 (6). pp. 631-644. ISSN 1460-2067

[img] Text

Download (557Kb)


A new graph similarity calculation procedure is introduced for comparing labeled graphs. Given a minimum similarity threshold, the procedure consists of an initial screening process to determine whether it is possible for the measure of similarity between the two graphs to exceed the minimum threshold, followed by a rigorous maximum common edge subgraph (MCES) detection algorithm to compute the exact degree and composition of similarity. The proposed MCES algorithm is based on a maximum clique formulation of the problem and is a significant improvement over other published algorithms. It presents new approaches to both lower and upper bounding as well as vertex selection.

Item Type: Article
Copyright, Publisher and Additional Information: © 2002 Oxford University Press. This is an author produced version of a paper published in The Computer Journal. Uploaded in accordance with the publisher's self-archiving policy.
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Social Sciences (Sheffield) > Information School (Sheffield)
The University of Sheffield > University of Sheffield Research Centres and Institutes > The Krebs Institute for Biomolecular Research (Sheffield)
Depositing User: Sherpa Assistant
Date Deposited: 11 Jan 2008 15:51
Last Modified: 08 Feb 2013 16:55
Published Version: http://dx.doi.org/10.1093/comjnl/45.6.631
Status: Published
Publisher: Oxford University Press
Identification Number: 10.1093/comjnl/45.6.631
URI: http://eprints.whiterose.ac.uk/id/eprint/3568

Actions (repository staff only: login required)