Coarse Grained Parallel Fixed-Parameter Tractable Algorithms (cid:3)
This paper shows how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice, and demonstrates the potential of parallelism when applied to the bounded tree search phase of FPT algorithms.
F. Dehne, A. Rau-Chaplin, U. Stege et al.
· 0 citations