Improved approximation of the largest common subtree of two unordered trees of bounded height
From MaRDI portal
Publication:975557
DOI10.1016/j.ipl.2008.09.025zbMath1191.68858OpenAlexW2076999762MaRDI QIDQ975557
Daiji Fukagawa, Atsuhiro Takasu, Tatsuya Akutsu
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.09.025
Related Items
Cites Work
- Unnamed Item
- A survey on tree edit distance and related problems
- On the editing distance between unordered labeled trees
- Some MAX SNP-hard results concerning unordered labeled trees
- A constrained edit distance between unordered labeled trees
- The Tree-to-Tree Correction Problem
- An Optimal Decomposition Algorithm for Tree Edit Distance