A novel edge-centric approach for graph edit similarity computation
作者：
Highlights：
• A Novel approach for computing the exact edit distance between labeled graphs.
• It leverages the relation between common sub-structures and graph edit distance.
• Efficient heuristics to cut off the huge search space.
• An exact method which can also be used as any-time approximation method.
• Experiments show the effectiveness on graph similarity search and classification.
摘要
•A Novel approach for computing the exact edit distance between labeled graphs.•It leverages the relation between common sub-structures and graph edit distance.•Efficient heuristics to cut off the huge search space.•An exact method which can also be used as any-time approximation method.•Experiments show the effectiveness on graph similarity search and classification.
论文关键词：Graph data,Edit distance,Exact methods,Graph similarity search
论文评审过程：Received 27 February 2018, Revised 12 August 2018, Accepted 24 October 2018, Available online 2 November 2018, Version of Record 8 November 2018.
论文官网地址：https://doi.org/10.1016/j.is.2018.10.003
