Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees

DOI10.1007/978-3-642-31265-6_29zbMath1358.05270OpenAlexW35439848MaRDI QIDQ2904510

Daiji Fukagawa, Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_29

zbMATH Keywords

dynamic programmingtree edit distanceunordered treesmaximum weight bipartite matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (1)

On the complexity of finding a largest common subtree of bounded degree

This page was built for publication: Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees