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, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
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). https://doi.org/10.1007/s00453-006-1214-1
- Parallel Algorithm
- Vertex Cover
- Sequential Algorithm
- Wall Clock Time
- Vertex Cover Problem