Efficient subgraph matching using topological node feature constraints
作者：
Highlights：
• We present four novel n-neighbourhood topological node features.
• We present three strengthening indices, used to enhance topological node features.
• A new subgraph isomorphism algorithm is introduced, enhancing existing pruning techniques.
摘要
Highlights•We present four novel n-neighbourhood topological node features.•We present three strengthening indices, used to enhance topological node features.•A new subgraph isomorphism algorithm is introduced, enhancing existing pruning techniques.
论文关键词：Graph matching,Subgraph isomorphism,Topological node features
论文评审过程：Received 31 August 2013, Revised 14 May 2014, Accepted 28 May 2014, Available online 12 June 2014.
论文官网地址：https://doi.org/10.1016/j.patcog.2014.05.018
