Finding cycles in hierarchical hypercube networks

Authors:
Ruei-Yu Wu;Gen-Huey Chen;Jung-Sheng Fu;Gerard J. Chang
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan and Department of Management Information Systems, Hwa Hsia Institute of Technology, Taipei, T ...;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan;Department of Electronic Engineering, National United University, Miaoli, Taiwan;Department of Mathematics, National Taiwan University, Taipei, Taiwan
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 0

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computation: models and methods

Parallel computation: models and methods
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems

IEEE Transactions on Parallel and Distributed Systems
Properties and Performance of the Hierarchical Hypercube

IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
The super laceability of the hypercubes

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

The hierarchical hypercube network, which was proposed as an alternative to the hypercube, is suitable for building a large-scale multiprocessor system. A bipartite graph G=(V,E) is bipancyclic if it contains cycles of all even lengths ranging from 4 to |V|. In this paper, we show that the hierarchical hypercube network is bipancyclic.