Author:
Baumbach Jan,Guo Jiong,Ibragimov Rashid
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. International Journal of Pattern Recognition and Artificial Intelligence (2004)
2. Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Analysis & Applications 13(1), 113–129 (2010)
3. Bunke, H., Riesen, K.: Graph Edit Distance – Optimal and Suboptimal Algorithms with Applications, pp. 113–143. Wiley-VCH Verlag GmbH & Co. KGaA (2009)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
5. Akutsu, T., Fukagawa, D., Takasu, A., Tamura, T.: Exact algorithms for computing the tree edit distance between unordered trees. Theor. Comput. Sci. 412, 352–364 (2011)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献