A critical examination of node-similarity based graph matching algorithms

Zhao, G., Petridis, Miltiadis, Sidorov, G. and Ma, J. (2008) A critical examination of node-similarity based graph matching algorithms Research in Computing Science, 40. pp. 73-82. ISSN 1870-4069

Full text not available from this repository.


In this paper, we shall critically examine a special class of graph matching algorithms that follow the approach of node-similarity measurement. A high-level algorithm framework, namely node-similarity graph matching framework (NSGM framework), is proposed, from which, many existing graph matching algorithms can be subsumed, including the eigen-decomposition method of Umeyama, the polynomial-transformation method of Almohamad, the hubs and authorities method of Kleinberg, and the kronecker product successive projection methods of Wyk, etc. In addition, improved algorithms can be developed from the NSGM framework with respects to the corresponding results in graph theory. As the observation, it is pointed out that, in general, any algorithm which can be subsumed from NSGM framework fails to work well for graphs with non-trivial auto-isomorphism structure.

Item Type: Journal article
Uncontrolled Keywords: Graph matching; node-similarity
Subjects: G000 Computing and Mathematical Sciences > G400 Computing
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Computational Intelligence
Depositing User: Converis
Date Deposited: 12 Jan 2012 11:50
Last Modified: 01 May 2015 13:01
URI: http://eprints.brighton.ac.uk/id/eprint/9672

Actions (login required)

View Item View Item


Downloads per month over past year