Skip to main content
SpringerLink
Log in

Scalable Parallel Algorithms for FPT Problems

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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 via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Division of Computer Science and Mathematics, Lebanese American University, Beirut, Lebanon

    Faisal N. Abu-Khzam

  2. Department of Computer Science, University of Tennessee, Knoxville, TN 37996-3450, USA

    Michael A. Langston, Pushkar Shanbhag & Christopher T. Symons

Authors
  1. Faisal N. Abu-Khzam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael A. Langston
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pushkar Shanbhag
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christopher T. Symons
    View author publications

    You can also search for this author in PubMed Google Scholar

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). https://doi.org/10.1007/s00453-006-1214-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-006-1214-1

Keywords

Search

Navigation