Pages that link to "Item:Q2348030"

The following pages link to On the complexity of finding a largest common subtree of bounded degree (Q2348030):

Displaying 10 items.

• Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
• On the approximation of largest common subtrees and largest common point sets (Q1575954) (← links)
• On the computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← links)
• Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees (Q2235776) (← links)
• An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
• On the Complexity of Finding a Largest Common Subtree of Bounded Degree (Q2842767) (← links)
• Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (Q2942616) (← links)
• On the Complexity of Extracting Subtree with Keeping Distinguishability (Q2958316) (← links)
• About the largest subtree common to several X-trees (Q3010530) (← links)
• Finding largest common embeddable subtrees (Q4596639) (← links)