For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Brighton

Return to search Previous output Next output
Output 2 of 32 in the submission
Article title

A critical examination of node-similarity based graph matching algorithms

Type
D - Journal article
DOI
-
Title of journal
Research in Computing Science
Article number
-
Volume number
40
Issue number
-
First page of article
73
ISSN of journal
1870-4069
Year of publication
2008
URL
-
Number of additional authors
3
Additional information

<12>

This paper provides a unified framework for generating, testing, analysing, comparing and expanding the node-similarity graph matching algorithms. This research was motivated by a series of research projects that aimed at the re-use of knowledge associated with structures. The framework has since been incorporated into the approaches taken by a number of research projects in the area of Case-Based Reasoning on structure-based similarity measures calculated by node-similarity graph matching algorithms. This has allowed the development of usable graph matching algorithms by the authors ranging from UML diagram matching, Business Process matching and 3D engineering component matching for casting processes.

Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
-
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-