Login / Signup
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance.
Debarati Das
Jacob Gilbert
MohammadTaghi Hajiaghayi
Tomasz Kociumaka
Barna Saha
Hamed Saleh
Published in:
FOCS (2022)
Keyphrases
</>
tree edit distance
k means
dynamic programming
matching algorithm
object recognition
relaxation labeling
similarity measure
lower bound
pairwise
np hard
simulated annealing
distance metric
combinatorial optimization