Publisher
Springer International Publishing
Reference20 articles.
1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
2. Canfield, E.R., Xing, G.: Approximate matching of XML document with regular hedge grammar. Int. J. Comput. Math. 82(10), 1191–1198 (2005)
3. Comon, H., Dauchet, M., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007)
4. Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6(1), 2:1–2:19 (2009)
5. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596–615 (1987)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finite Approximations and Similarity of Languages;International Journal of Foundations of Computer Science;2022-05-28
2. Top-down tree edit-distance of regular tree languages;International Journal of Advances in Engineering Sciences and Applied Mathematics;2018-07-11