Node-disjoint paths in a level block of generalized hierarchical completely connected networks

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free