A parallel graph edit distance algorithm

作者：

Highlights：

• Elaborating fast and precise graph edit distance (GED) is of first interest.

• A Parallel GED algorithm with load balancing strategy is proposed.

• The algorithm is based on a branch-and-bound algorithm.

• Seven algorithms are compared on a set of graph datasets.

• Our method has more precise solutions while requiring a low memory usage.

摘要

•Elaborating fast and precise graph edit distance (GED) is of first interest.•A Parallel GED algorithm with load balancing strategy is proposed.•The algorithm is based on a branch-and-bound algorithm.•Seven algorithms are compared on a set of graph datasets.•Our method has more precise solutions while requiring a low memory usage.

论文关键词：Graph matching,Parallel computing,Graph edit distance,Pattern recognition,Load balancing

论文评审过程：Received 22 June 2017, Revised 14 September 2017, Accepted 18 October 2017, Available online 20 October 2017, Version of Record 5 November 2017.

论文官网地址：https://doi.org/10.1016/j.eswa.2017.10.043