4 search results - page 1 / 1 » New Fixed-Parameter Algorithms for the Minimum Quartet Incon... |
MST
2010
13 years 4 months ago
2010
MST
2010
13 years 4 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
CP
2007
Springer
13 years 9 months ago
2007
Springer
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
DAM
2010
13 years 5 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...