The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
How to Systematically Embed Cycles in Balanced Hypercubes
|
Author(s): Hsuan-Han Chang (Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng, Taiwan), Kuan-Ting Chen (Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng, Taiwan)and Pao-Lien Lai (Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng, Taiwan)
Copyright: 2017
Volume: 5
Issue: 1
Pages: 13
Source title:
International Journal of Software Innovation (IJSI)
Editor(s)-in-Chief: Roger Y. Lee (Central Michigan University, USA)and Lawrence Chung (The University of Texas at Dallas, USA)
DOI: 10.4018/IJSI.2017010104
Purchase
|
Abstract
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.
Related Content
Yogesh M. Kamble, Raj B. Kulkarni.
© 2024.
10 pages.
|
Zachary Estreito, Vinh Le, Frederick C. Harris Jr., Sergiu M. Dascalu.
© 2024.
15 pages.
|
Chase D. Carthen, Araam Zaremehrjardi, Vinh Le, Carlos Cardillo, Scotty Strachan, Alireza Tavakkoli, Frederick C. Harris Jr., Sergiu M. Dascalu.
© 2024.
14 pages.
|
Partha Ghosh, Takaaki Goto, Leena Jana Ghosh, Giridhar Maji, Soumya Sen.
© 2024.
15 pages.
|
Megha Bhushan, Utkarsh Verma, Chetna Garg, Arun Negi.
© 2024.
14 pages.
|
Kuo Jong-Yih, Hsieh Ti-Feng, Lin Yu-De, Lin Hui-Chi.
© 2024.
17 pages.
|
.
© 2024.
|
|
|