Pages that link to "Item:Q1671997"
From MaRDI portal
The following pages link to A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997):
Displaying 11 items.
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Improved approximation algorithms for two-stage flowshops scheduling problem (Q2285149) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- A faster FPT algorithm for the maximum agreement forest problem (Q2464325) (← links)
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
