Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance
| Title: | Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance |
|---|---|
| Authors: | Das, Debarati; Gilbert, Jacob; Hajiaghayi, MohammadTaghi; Kociumaka, Tomasz; Saha, Barna; Saleh, Hamed |
| Source: | 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on. :686-697 Oct, 2022 |
| Relation: | 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) |
| Database: | IEEE Xplore Digital Library |