Edge-disjoint hamiltonian cycles of WK-recursive networks

Authors:
Chien-Hung Huang;Jywe-Fei Fang;Chin-Yang Yang
Affiliations:
National Formosa University, Yun-Lin, Taiwan, R.O.C.;St.John's and St.Mary's Institute of Technology, Taipei, Taiwan, R.O.C.;National Taiwan University Hospital, Taipei, Taiwan, R.O.C.
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 7
Cited 0

A recursively scalable network VLSI implementation

Future Generation Computer Systems
Optimum Broadcasting and Personalized Communication in Hypercubes

IEEE Transactions on Computers
Hamiltonian decomposition of Cayley graphs of degree 4

Journal of Combinatorial Theory Series B
An optimized broadcasting technique for WK-Recursive topologies

Future Generation Computer Systems - Improving perfomance in multiprocessors and networks
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Two edge-disjoint Hamiltonian cycles in the butterfly graph

Information Processing Letters
Substructure Allocation in Recursive Interconnection Networks

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that there exist n edge-disjoint Hamiltonian cycles in the WK-Recursive networks with amplitude 2n +1. By the aid of these edge-disjoint Hamiltonian cycles, nearly optimal all-to-all broadcasting communication on all-port WK-Recursive networks can be derived.