This article is cited in 2 papers

Information Technology Applications in Control

On efficient construction of hamiltonian cycles in distributed computer systems by recurrent neural networks

M. S. Tarkov

Institute of Semiconductor Physics of SB RAS

Abstract: Construction of Hamiltonian cycles in a graph of distributed computer system with $n$ vertices by a recurrent neural network is considered. The method of partial sums is proposed to reduce time of differential equations solution, which describe the neural network, from $O(n^3)$ to $O(n^2)$. It is shown that the neural network algorithm which uses partial sums is competitive with known permutation methods.

Keywords: distributed computer systems, recurrent neural networks, graphs, Hamiltonian cycle.

UDC: 004.032.26(06)
BBK: 32.818я7