Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818): Difference between revisions
From MaRDI portal
Latest revision as of 12:37, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient exponential-time algorithms for edit distance between unordered trees |
scientific article |
Statements
Efficient exponential-time algorithms for edit distance between unordered trees (English)
0 references
1 April 2014
0 references
edit distance
0 references
unordered tree
0 references
algorithm
0 references
bipartite matching
0 references
0 references
0 references