Pages that link to "Item:Q975557"

The following pages link to Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557):

Displaying 1 item.

• Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)