Highly Influenced

# 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} }

- Published 2003 in J. Comput. Syst. Sci.
DOI:10.1016/S0022-0000(03)00075-8

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

#### From This Paper

##### Figures, tables, and topics from this paper.

54 Citations

33 References

Similar Papers