How to Systematically Embed Cycles in Balanced Hypercubes
The balanced hypercube is a variant of the hypercube structure and has desirable properties like connectivity, regularity, and symmetry. The cycle is a popular interconnection topology and has been widely used in distributed-memory parallel computers. Moreover, parallel algorithms of cycles have been extensively developed and used. The problem of how to embed cycles into a host graph has attracted a great attention in recent years. However, there is no systematic method proposed to generate the desired cycles in balanced hypercubes. In this paper, the authors develop systematic linear time algorithm to construct cycles and Hamiltonian cycles for the balanced hypercube.
Year of publication: |
2017
|
---|---|
Authors: | Chang, Hsuan-Han ; Chen, Kuan-Ting ; Lai, Pao-Lien |
Published in: |
International Journal of Software Innovation (IJSI). - IGI Global, ISSN 2166-7179, ZDB-ID 2754488-6. - Vol. 5.2017, 1 (01.01.), p. 44-56
|
Publisher: |
IGI Global |
Subject: | Balanced Hypercube | Double Reflected Edge Label Sequence | Embedding | Hamiltonian Cycle | Generalized Gray Code |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
СЕРГЕЕВИЧ, ТАРКОВ МИХАИЛ, (2013)
-
Guides and Shortcuts in Graphs
Mulder, Mulder, H.M., (2011)
-
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
Feng, Jinfeng, (2009)
- More ...