Publications related to 'kernelization' : Kernelization is a method used in fixed-parameter complexity to reduce the instance to get one whose size depends only on the value of the parameter k, and is as small as possible (polynomial, or even quadratic or linear). Then, any exact algorithm solving the problem, applied on this smaller instance obtained by applying reduction rules, will directly provide an FPT algorithm for parameter k.
 
Order by:   Type | Year
           related to:
Associated keywords
2014
1
photophoto
Leo van Iersel and Steven Kelk. Kernelizations for the hybridization number problem on multiple nonbinary trees. In WG14, Vol. 8747:299-311 of LNCS, springer, 2014.  
Keywords: explicit network, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Treeduce, reconstruction.
Note: http://arxiv.org/abs/1311.4045.
       

2013
2
photophoto
Leo van Iersel and Simone Linz. A quadratic kernel for computing the hybridization number of multiple trees. In IPL, Vol. 113:318-323, 2013.  
Keywords: explicit network, FPT, from rooted trees, kernelization, minimum number, phylogenetic network, phylogeny, Program Clustistic, Program MaafB, Program PIRN, reconstruction.
Note: http://arxiv.org/abs/1203.4067, poster.
       
Toggle abstract