Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems

ISSN： 1995-4239

Source： Numerical Analysis and Applications, Vol.3, Iss.4, 2010-10, pp. : 381-388

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Some graphs containing unique Hamiltonian cycles

By Lynch M. A. M.

International Journal of Mathematical Education in Science and Technology, Vol. 33, Iss. 2, 2002-03 ,pp. : 231-240

Taylor & Francis Ltd

Access to resources Recommend Favorite

Identification of fuzzy dynamic systems using Max-Min recurrent neural networks

By Blanco A. Delgado M. Pegalajar M.C.

Fuzzy Sets and Systems, Vol. 122, Iss. 3, 2001-09 ,pp. : 451-467

Elsevier

Access to resources Recommend Favorite

Fault-free mutually independent Hamiltonian cycles of faulty star graphs

By Kung Tzu-Liang

International Journal of Computer Mathematics, Vol. 88, Iss. 4, 2011-03 ,pp. : 731-746

Taylor & Francis Ltd

Access to resources Recommend Favorite

Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 4, 2018-04 ,pp. : 660-671

John Wiley & Sons Inc

Access to resources Recommend Favorite

Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes

By Liu Hui Zhang Linbo

International Journal of Computer Mathematics, Vol. 88, Iss. 6, 2011-04 ,pp. : 1137-1143

Taylor & Francis Ltd

Access to resources Recommend Favorite