On the Complexity of Tree Edit Distance with Variables

Tatsuya Akutsu, Tomoya Mori, Naotoshi Nakamura, Satoshi Kozawa, Yuhei Ueno, Thomas N. Sato. On the Complexity of Tree Edit Distance with Variables. In Sang Won Bae, Heejin Park, editors, 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea. Volume 248 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.