Generalized hierarchical completely connected networks (for short, HCCs), which include conventional hierarchical networks, have been proposed. An HCC is a network topology for a massively parallel computer system. To apply an HCC to a parallel computer system effectively and to execute data processing on the HCC efficiently, the inherent fault-tolerant properties in an HCC must be revealed. However, these properties have not been clarified sufficiently. In this paper, node-disjoint paths are verified for a level block of the HCC. © 2012 Elsevier B.V. All rights reserved.
CITATION STYLE
Takabatake, T., & Nakamigawa, T. (2012). Node-disjoint paths in a level block of generalized hierarchical completely connected networks. Theoretical Computer Science, 465, 28–34. https://doi.org/10.1016/j.tcs.2012.09.016
Mendeley helps you to discover research relevant for your work.