Efficient subgraph matching using topological node feature constraints

Dahm, Nicholas, Bunke, Horst, Caelli, Terry and Gao, Yongsheng 2015, Efficient subgraph matching using topological node feature constraints, Pattern Recognition, vol. 48, no. 2, pp. 317-330, doi: 10.1016/j.patcog.2014.05.018.

Attached Files
Name Description MIMEType Size Downloads

Title Efficient subgraph matching using topological node feature constraints
Author(s) Dahm, Nicholas
Bunke, Horst
Caelli, TerryORCID iD for Caelli, Terry orcid.org/0000-0001-9281-2556
Gao, Yongsheng
Journal name Pattern Recognition
Volume number 48
Issue number 2
Start page 317
End page 330
Total pages 14
Publisher Elsevier
Place of publication Amsterdam, The Netherlands
Publication date 2015
ISSN 0031-3203
Keyword(s) graph matching
subgraph isomorphism
topological node features
Science & Technology
Computer Science, Artificial Intelligence
Engineering, Electrical & Electronic
Computer Science
Language eng
DOI 10.1016/j.patcog.2014.05.018
Indigenous content off
Field of Research 0899 Other Information and Computing Sciences
0906 Electrical and Electronic Engineering
0801 Artificial Intelligence and Image Processing
HERDC Research category C1.1 Refereed article in a scholarly journal
Persistent URL http://hdl.handle.net/10536/DRO/DU:30135748

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 8 times in TR Web of Science
Scopus Citation Count Cited 12 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 48 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Tue, 24 Mar 2020, 08:30:30 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.