Parallel Backtracking Algorithm for Hamiltonian Path Search

  • Karol Grondzak
  • Penka Martincova
Keywords: no keywords

Abstract

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.

Author Biographies

Karol Grondzak

Department of Informatics, Faculty of Management Science and Informatics, University of Zilina, Slovakia

Penka Martincova

Department of Informatics, Faculty of Management Science and Informatics, University of Zilina, Slovakia

Published
2009-09-30
How to Cite
Grondzak, K., & Martincova, P. (2009). Parallel Backtracking Algorithm for Hamiltonian Path Search. Communications - Scientific Letters of the University of Zilina, 11(3), 15-19. Retrieved from http://journals.uniza.sk/index.php/communications/article/view/1000
Issue
Vol 11 No 3 (2009)
Section
Articles