On link-disjoint Hamiltonian cycles of torus networks

作     者：Latifi, S Zheng, SQ 

作者机构：LOUISIANA STATE UNIVDEPT COMP SCIBATON ROUGELA 70803 

出 版 物：《COMPUTERS & ELECTRICAL ENGINEERING》 (计算机与电工)

年 卷 期：1997年第23卷第1期

页      面：25-32页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：fault-tolerant computing network embedding parallel and distributed computing ring 

摘      要：The problem of embedding link-disjoint Hamiltonian cycles into torus networks is addressed. The maximum number of link-disjoint cycles is limited to half the degree of the node in a regular network. Simple methods are presented to embed the maximum number of link-disjoint Hamiltonian cycles in an r-dimensional torus network. An algorithm for finding a Hamiltonian cycle in an r-dimensional torus in the presence of a set of faulty links is also given. Copyright (C) 1997 Elsevier Science Ltd