A novel hierarchical-based framework for upper bound computation of graph edit distance
作者：
Highlights：
• A Novel approach for upper bound computation of graph edit distance.
• It builds on the breadth-first hierarchical views of the graphs.
• Efficient view-matching methods to build graph mappings.
• Efficient view-selection methods for the matching process.
• Experiments show the approaches efficiency and effectiveness over current methods.
摘要
•A Novel approach for upper bound computation of graph edit distance.•It builds on the breadth-first hierarchical views of the graphs.•Efficient view-matching methods to build graph mappings.•Efficient view-selection methods for the matching process.•Experiments show the approaches efficiency and effectiveness over current methods.
论文关键词：Graph similarity,Graph edit distance,Upper bound
论文评审过程：Received 12 May 2017, Revised 18 November 2017, Accepted 20 March 2018, Available online 21 March 2018, Version of Record 31 March 2018.
论文官网地址：https://doi.org/10.1016/j.patcog.2018.03.019
