, Volume 45, Issue 3, pp 269–284 | Cite as

Scalable Parallel Algorithms for FPT Problems



Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems of significance. As a case study, optimal solutions to very large instances of the NP-hard vertex cover problem are computed. To accomplish this, an efficient sequential algorithm and various forms of parallel algorithms are devised, implemented, and compared. The importance of maintaining a balanced decomposition of the search space is shown to be critical to achieving scalability. Target problems need only be amenable to reduction and decomposition. Applications in high throughput computational biology are also discussed.


Parallel Algorithm Vertex Cover Sequential Algorithm Wall Clock Time Vertex Cover Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Division of Computer Science and Mathematics, Lebanese American University, BeirutLebanon
  2. 2.Department of Computer Science, University of Tennessee, Knoxville, TN 37996-3450USA

Personalised recommendations