Skip to main content

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.

This is a preview of subscription content, access via your institution.

Author information



Corresponding authors

Correspondence to Michael A. Langston, Pushkar Shanbhag or Christopher T. Symons.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Abu-Khzam, F., Langston, M., Shanbhag, P. et al. Scalable Parallel Algorithms for FPT Problems. Algorithmica 45, 269–284 (2006).

Download citation


  • Parallel Algorithm
  • Vertex Cover
  • Sequential Algorithm
  • Wall Clock Time
  • Vertex Cover Problem