Pages that link to "Item:Q2642315"
From MaRDI portal
The following pages link to Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q2642315):
Displaying 5 items.
- On the extremal maximum agreement subtree problem (Q2197478) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115) (← links)
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (Q2942616) (← links)
- Combinatorial Pattern Matching (Q5315329) (← links)