Pages that link to "Item:Q1901396"
From MaRDI portal
The following pages link to An algorithm to find agreement subtrees (Q1901396):
Displaying 9 items.
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- An improved bound on the maximum agreement subtree problem (Q1036838) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- Kaikoura tree theorems: Computing the maximum agreement subtree (Q1313765) (← links)
- The agreement metric for labeled binary trees (Q1340485) (← links)
- On the agreement of many trees (Q1352115) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- Computing the unrooted maximum agreement subtree in sub-quadratic time (Q5054809) (← links)
