Welcome to the InfoSci Platform
Reference Hub1
How to Systematically Embed Cycles in Balanced Hypercubes

How to Systematically Embed Cycles in Balanced Hypercubes

Hsuan-Han Chang, Kuan-Ting Chen, Pao-Lien Lai
Copyright: © 2017 |Volume: 5 |Issue: 1 |Pages: 13
ISSN: 2166-7160|EISSN: 2166-7179|EISBN13: 9781522515531|DOI: 10.4018/IJSI.2017010104
Cite Article Cite Article

MLA

Chang, Hsuan-Han, et al. "How to Systematically Embed Cycles in Balanced Hypercubes." IJSI vol.5, no.1 2017: pp.44-56. http://doi.org/10.4018/IJSI.2017010104

APA

Chang, H., Chen, K., & Lai, P. (2017). How to Systematically Embed Cycles in Balanced Hypercubes. International Journal of Software Innovation (IJSI), 5(1), 44-56. http://doi.org/10.4018/IJSI.2017010104

Chicago

Chang, Hsuan-Han, Kuan-Ting Chen, and Pao-Lien Lai. "How to Systematically Embed Cycles in Balanced Hypercubes," International Journal of Software Innovation (IJSI) 5, no.1: 44-56. http://doi.org/10.4018/IJSI.2017010104

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.