Pages that link to "Item:Q3011871"
From MaRDI portal
The following pages link to Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871):
Displaying 5 items.
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
- Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
- Tractable and intractable variations of unordered tree edit distance (Q2929619) (← links)
- Parameterizing MAX SNP Problems Above Guaranteed Values (Q3499722) (← links)