Pages that link to "Item:Q5483380"
From MaRDI portal
The following pages link to FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380):
Displaying 13 items.
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Space efficient algorithms for ordered tree comparison (Q930598) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings (Q2746434) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- (Q4432975) (← links)
- (Q4547753) (← links)
- A Comparison of Many Max-tree Computation Algorithms (Q4925097) (← links)
- Combinatorial Pattern Matching (Q5315356) (← links)
- Algorithms and Computation (Q5712135) (← links)