DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM
Keywords:
vehicle routing; Hamiltonian path; Message Passing InterfaceAbstract
Many practical problems of transportation can be transformed to the problem of finding Hamiltonian path or circle. It was proven, that this problem is NP-complete and thus can be very time-consuming for practical problem size. In this paper we present a distributed algorithm to search for Hamiltonian path in a graph.
Downloads
Download data is not yet available.
References
[1] KUČERA, L. Kombinatorické algoritmy. Praha: SNTL, 1989. 286 pp. ISBN 04-009-89.
[2] OpenMP [online]. c2010 [cit. 2010-11-19] Available from <http://openmp.org/wp/>
[3] MPI Documents [online]. c2010 [cit. 2010-11-19] Available from: <http://
www.mpi-forum.org/docs/docs.html>.
[4] WILKINSON, B., ALLEN, M. Parallel Programming. Upper Saddle River: Pearson
Education, 2005. 467pp. ISBN: 0-13-140563-2
[5] OpenMPI [online] c2010 [cit. 2010-11-19] Available from <http://www.open-mpi.org/>
[2] OpenMP [online]. c2010 [cit. 2010-11-19] Available from <http://openmp.org/wp/>
[3] MPI Documents [online]. c2010 [cit. 2010-11-19] Available from: <http://
www.mpi-forum.org/docs/docs.html>.
[4] WILKINSON, B., ALLEN, M. Parallel Programming. Upper Saddle River: Pearson
Education, 2005. 467pp. ISBN: 0-13-140563-2
[5] OpenMPI [online] c2010 [cit. 2010-11-19] Available from <http://www.open-mpi.org/>
Downloads
Published
2010-12-30
How to Cite
Grondžák, K. (2010). DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM. Perner’s Contacts, 5(4), 62–67. Retrieved from https://pernerscontacts.upce.cz/index.php/perner/article/view/1043
Issue
Section
Articles
License
Copyright (c) 2020 Karol Grondžák
This work is licensed under a Creative Commons Attribution 4.0 International License.
