Approximation and special cases of common subtrees and editing distance

DOI10.1007/BFB0009483zbMath1512.68224MaRDI QIDQ6487427

Keisuke Tanaka, Magnús M. Halldórsson

Publication date: 25 January 2023

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (4)

An efficient fixed-parameter algorithm for 3-hitting set ⋮ Exact algorithms for computing the tree edit distance between unordered trees ⋮ Efficient exponential-time algorithms for edit distance between unordered trees ⋮ Improved approximation of the largest common subtree of two unordered trees of bounded height

Cites Work

• On the editing distance between unordered labeled trees

This page was built for publication: Approximation and special cases of common subtrees and editing distance