Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem

DOI10.1007/978-3-540-73437-6_28zbMath1138.68427OpenAlexW2595466275MaRDI QIDQ3506929

Sylvain Guillemot, Vincent Berry

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00130406/file/RR07005.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Data structures (68P05)

Related Items (4)

Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique ⋮ Improved algorithms for maximum agreement and compatible supertrees ⋮ New results on optimizing rooted triplets consistency ⋮ Fixed-Parameter Algorithms for Finding Agreement Supertrees

This page was built for publication: Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem