Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees |
scientific article; zbMATH DE number 6065616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees |
scientific article; zbMATH DE number 6065616 |
Statements
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (English)
0 references
14 August 2012
0 references
tree edit distance
0 references
unordered trees
0 references
dynamic programming
0 references
maximum weight bipartite matching
0 references
