Pages that link to "Item:Q620949"
From MaRDI portal
The following pages link to Exact algorithms for computing the tree edit distance between unordered trees (Q620949):
Displaying 6 items.
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Covering tree with stars (Q2354301) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- (Q5091018) (← links)
- Characterization of random walks on space of unordered trees using efficient metric simulation (Q6069174) (← links)
