Perner’s Contacts (Dec 2010)

DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM

  • Karol Grondžák

Journal volume & issue
Vol. 5, no. 4

Abstract

Read online

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.

Keywords