Pages that link to "Item:Q1198043"
From MaRDI portal
The following pages link to On the editing distance between unordered labeled trees (Q1198043):
Displayed 18 items.
- Tree edit distance and maximum agreement subtree (Q458389) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Graph embedding using tree edit-union (Q869016) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- On the editing distance between unordered labeled trees (Q1198043) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- Tree edit distance with gaps (Q1853686) (← links)
- A constrained edit distance between unordered labeled trees (Q1908261) (← links)
- Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE (Q2929619) (← links)
- New dissimilarity measure for recognizing noisy subsequence trees (Q2997938) (← links)
- Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)