The decycling problem in hierarchical cubic networks
β Scribed by Bossard, Antoine
- Book ID
- 125369449
- Publisher
- Springer US
- Year
- 2014
- Tongue
- English
- Weight
- 416 KB
- Volume
- 69
- Category
- Article
- ISSN
- 0920-8542
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A hierarchical cubic network was proposed as an alternative to the hypercube. By HCN(__n__), we denote the hierarchical cubic network that contains 2^__n__^ __n__βdimensional hypercubes. In this paper, using Gray codes, we construct faultβfree Hamiltonian cycles in an HCN(__n__) with __
In this paper the authors introduce the hierarchical network design problem (HNDP). The object of the HNDP is to identify the least cost, two-level hierarchical network. The network must include a primary path from a predetermined starting node to a predetermined terminus node. In addition, each nod