Output details
11 - Computer Science and Informatics
University of Brighton
A critical examination of node-similarity based graph matching algorithms
<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.