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.
References
Downloads
Published
2010-12-30
Issue
Section
Articles
License
Copyright (c) 2020 Karol Grondžák
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM. (2010). Perner’s Contacts, 5(4), 62-67. https://pernerscontacts.upce.cz/index.php/perner/article/view/1043
