The speed of calculations is a common problem to tackle in many areas of scientific research and real life. This paper presents an implementation of a parallel backtracking algorithm. The performance of the proposed algorithm is demonstrated on the problem of Hamiltonian Path search. Obtained results exhibit significant improvement of the parallel algorithm over the sequential one. Different aspects of parallelization of backtracking algorithm are studied and presented.
No takes yet. Share an insight, caveat, or question.
Grondžák et al. (2009) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: