Adequate choice of data structures and special effort in implementation are crucial to the good performance of parallel algorithms. In this paper, we present experimental results of a BSP/CGM implementation for the FPT (Fixed-Parameter Tractability) Vertex Cover problem, also known as k-Vertex Cover. We propose an alternative implementation that has as its basis an algorithm that combines the parallel FPT algorithm proposed by Cheetham et al. and the Downey’s et al. sequential FPT algorithm. Previously, a better and refined implementation, based on the Cheetham et al. Algorithm was presented by Hanashiro. In his experiments, Hanashiro obtained better results than those presented by Cheetham et al. In this paper, implemented the new adapted algorithm for the k-Vertex Cover and compared our experimental results with those of Hanashiro et al, using the same input data (conflict graphs of amino acids). We report substantial improvement over the results of Hanahiro et al, with speedups from 3 to 20 times relative to that implementation. 1.