Pages that link to "Item:Q2904510"
From MaRDI portal
The following pages link to Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510):
Displaying 4 items.
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648) (← links)