
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.
Railroad engineering and operation, Industrial engineering. Management engineering, Hamiltonian path, Message Passing Interface, T55.4-60.8, TF1-1620, vehicle routing
Railroad engineering and operation, Industrial engineering. Management engineering, Hamiltonian path, Message Passing Interface, T55.4-60.8, TF1-1620, vehicle routing
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
