"Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance."

Debarati Das et al. (2022)

Details and statistics

DOI: 10.48550/ARXIV.2209.07524

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics