Deakin University
Browse

File(s) under permanent embargo

Efficient subgraph matching using topological node feature constraints

journal contribution
posted on 2015-01-01, 00:00 authored by N Dahm, H Bunke, Terry CaelliTerry Caelli, Y Gao
© 2014 Elsevier Ltd. This paper presents techniques designed to minimise the number of states which are explored during subgraph isomorphism detection. A set of advanced topological node features, calculated from n-neighbourhood graphs, is presented and shown to outperform existing features. Further, the pruning effectiveness of both the new and existing topological node features is significantly improved through the introduction of strengthening techniques. In addition to topological node features, these strengthening techniques can also be used to enhance application-specific node labels using a proposed novel extension to existing pruning algorithms. Through the combination of these techniques, the number of explored search states can be reduced to near-optimal levels.

History

Journal

Pattern Recognition

Volume

48

Pagination

317-330

Location

Amsterdam, The Netherlands

ISSN

0031-3203

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Issue

2

Publisher

Elsevier