Geodesic
Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 4, pp. 467-475

Voir la notice de l'article provenant de la source Math-Net.Ru

An algorithm based on a recurrent neural Wang's network and the WTA (“Winner takes all”) principle is applied to the construction of Hamiltonian cycles in graphs of distributed computer systems (CSs). The algorithm is used for: 1) regular graphs (2D- and 3D-tori, and hypercubes) of distributed CSs and 2) 2D-tori disturbed by removing an arbitrary edge. The neural network parameters for the construction of Hamiltonian cycles and sub-optimal cycles with a length close to that of Hamiltonian ones are determined. Our experiments show that the iteration method (Jacobi, Gauss-Seidel, or SOR) used for solving the system of differential equations describing a neural network strongly affects the process of cycle construction and depends upon the number of torus nodes. 
@article{SJVM_2010_13_4_a8,
     author = {M. S. Tarkov},
     title = {Construction of {Hamiltonian} cycles by recurrent neural networks in graphs of distributed computer systems},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {467--475},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2010_13_4_a8/}
}
TY  - JOUR
AU  - M. S. Tarkov
TI  - Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2010
SP  - 467
EP  - 475
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJVM_2010_13_4_a8/
LA  - ru
ID  - SJVM_2010_13_4_a8
ER  - 
%0 Journal Article
%A M. S. Tarkov
%T Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2010
%P 467-475
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJVM_2010_13_4_a8/
%G ru
%F SJVM_2010_13_4_a8
M. S. Tarkov. Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 13 (2010) no. 4, pp. 467-475. http://geodesic.mathdoc.fr/item/SJVM_2010_13_4_a8/