Pages that link to "Item:Q1318750"
From MaRDI portal
The following pages link to Some MAX SNP-hard results concerning unordered labeled trees (Q1318750):
Displayed 8 items.
- A survey on tree edit distance and related problems (Q557823) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
- A constrained edit distance algorithm between semi-ordered trees (Q1006058) (← links)
- A constrained edit distance between unordered labeled trees (Q1908261) (← links)
- Data mining in an engineering design environment: OR applications from graph matching (Q2499148) (← links)
- Component reuse based agile reconfiguration for Enterprise Resource Planning (ERP) systems in manufacturing enterprises (Q5444435) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)