1+ ε approximation of tree edit distance in quadratic time
From MaRDI portal
Publication:5212811
DOI10.1145/3313276.3316388zbMath1433.68610OpenAlexW2953362850MaRDI QIDQ5212811
Saeed Seddighin, Mahdi Safarnejad Boroujeni, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3313276.3316388
Related Items
On the hardness of computing the edit distance of shallow trees, New and improved algorithms for unordered tree inclusion