The ‘LeRP’ algorithm approximates subgraph isomorphism for attributed graphs based on counts of length-r paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The basic approach of the LeRP algorithm differs fundamentally

Francisco Moreno-Seco، نويسنده , , Luisa Mic?، نويسنده , , Jose Oncina، نويسنده ,

روزنامه با شماره پیاپی سال 2003

7

47

53

metric spaces , Nearest neighbour , Non-parametric classification

PATTERN RECOGNITION LETTERS

2003

PATTERN RECOGNITION LETTERS

250532