%A XU Zhou-bo, ZHANG Kun, NING Li-hua and GU Tian-long %T Summary of Graph Edit Distance %0 Journal Article %D 2018 %J Computer Science %R 10.11896/j.issn.1002-137X.2018.04.002 %P 11-18 %V 45 %N 4 %U {https://www.jsjkx.com/CN/abstract/article_40.shtml} %8 2018-04-15 %X Graph edit distance is one of the most flexible and general graph pattern matching models available.This matching method has provoked wide concern from scholars owing to its capability to handle many kinds of graph data.Firstly,the related concepts of graph edit distance were introduced.Then the exact graph edit distance algorithms based on heuristic search technology were described briefly,and the inexact edit distance algorithms of bipartite graph matching was emphaticallyanalyzed.Finally,some existing problems were summarized,and the future development trend was simply discussed.