Pages that link to "Item:Q5365715"
From MaRDI portal
The following pages link to Exact and approximate algorithms for unordered tree matching (Q5365715):
Displaying 11 items.
- Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- Data mining in an engineering design environment: OR applications from graph matching (Q2499148) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)
- (Q5091018) (← links)
- Identifying consensus of trees through alignment (Q5938834) (← links)
- Finding approximate patterns in undirected acyclic graphs (Q5959618) (← links)
