Abstract
In many applications NP-complete problems need to be solved exactly. One promising method to treat some intractable problems is by considering the so-called Parameterized Complexity that divides the problem input into a main part and a parameter. The main part of the input contributes polynomially on the total complexity of the problem, while the parameter is responsible for the combinatorial explosion. We consider the parallel FPT algorithm of Cheetham et al. to solve the k-Vertex Cover problem, using the CGM model. Our contribution is to present a refined and improved implementation. In our parallel experiments, we obtained better results and obtained smaller cover sizes for some input data. The key idea for these results was the choice of good data structures and use of the backtracking technique. We used 5 graphs that represent conflict graphs of amino acids, the same graphs used also by Cheetham et al. in their experiments. For two of these graphs, the times we obtained were approximately 115 times better, for one of them 16 times better, and, for the remaining graphs, the obtained times were slightly better. We must also emphasize that we used a computational environment that is inferior than that used in the experiments of Cheetham et al.. Furthermore, for three graphs, we obtained smaller sizes for the cover.
Partially supported by FAPESP grant 1997/10982-0, CNPq grants 30.5218/03-4, 30.0482/02-7, 55.2028/02-9 and DS-CAPES.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1998)
Balasubramanian, R., Fellows, M.R., Raman, V.: An improved fixed-parameter algorithm for vertex cover. Information Processing Letters 65, 163–168 (1998)
Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable parallel computational geometry for coarse grained multicomputers. In: Proceedings of the ACM 9th Annual Computational Geometry, pp. 298–307 (1993)
Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.: Solving large FPT problems on coarse grained parallel machines. Journal of Computer and System Sciences 4, 691–706 (2003)
Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24, 873–921 (1995)
Downey, R.G., Fellows, M.R.: Parameterized complexity after (almost) 10 years: Review and open questions. In: Combinatorics, Computation & Logic, DMTCS 1999 and CATS 1999. Australian Comput. Sc. Comm., vol. 21(3), pp. 1–33. Springer, Heidelberg (1999)
Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future. AMS-DIMACS Proceedings Series, vol. 49, pp. 49–99 (1999)
Niedermeier, R.: Some prospects for efficient fixed parameter algorithms. In: Conf. on Current Trends in Theory and Practice of Informatics, pp. 168–185 (1998)
Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM J. Comput. 22, 560–572 (1993)
Chan, A., Dehne, F.: A note on course grained parallel integer sorting. In: 13th Annual Int. Symposium on High Performance Computers, pp. 261–267 (1999)
Hanashiro, E.J.: O problema da k-Cobertura por Vértices: uma implementação FPT no modelo CGM. Master’s thesis, Universidade Federal de Mato Grosso do Sul (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanashiro, E.J., Mongelli, H., Song, S.W. (2004). Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive