Pages that link to "Item:Q2442818"
From MaRDI portal
The following pages link to Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818):
Displaying 7 items.
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- A constrained edit distance between unordered labeled trees (Q1908261) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510) (← links)
- Tractable and intractable variations of unordered tree edit distance (Q2929619) (← links)
- Edit distance between unrooted trees in cubic time (Q5002720) (← links)
- (Q5091018) (← links)