Solving large FPT problems on coarse-grained parallel machines

@article{Cheetham2003SolvingLF,
  title={Solving large FPT problems on coarse-grained parallel machines},
  author={James Cheetham and Frank Dehne and Andrew Rau-Chaplin and Ulrike Stege and Peter J. Taillon},
  journal={J. Comput. Syst. Sci.},
  year={2003},
  volume={67},
  pages={691-706}
}
Fixed-parameter tractability (FPT ) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice. More precisely, we demonstrate the potential of parallelism when applied to the bounded-tree search phase of FPT algorithms. We apply our… CONTINUE READING
54 Citations
33 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Fellows.“Fixed Parameter Tractability and Completeness I: Basic Theory

  • M.R.R.G. Downey
  • In SIAM Journal of Computing,
  • 1995
Highly Influential
4 Excerpts

Parameterized Computational Feasibility

  • R. G. Downey, M. R. Fellows
  • Feasible Mathematics II , P. Clote, J. Remmel…
  • 1995
Highly Influential
4 Excerpts

On the complexity of vertex set problems

  • M. R. Fellows
  • Technical report, Computer Science Department…
  • 1988
Highly Influential
1 Excerpt

Private communication

  • L. DeVroye
  • GRACO Conference,
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…