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

Authors:
Toshinori Takabatake;Tomoki Nakamigawa
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2012

Citing 19
Cited 0

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Topological properties of WK-recursive networks

Journal of Parallel and Distributed Computing
Fault Tolerance Properties of Pyramid Networks

IEEE Transactions on Computers
Combinatorial Properties of Two-Level Hypernet Networks

IEEE Transactions on Parallel and Distributed Systems
Edge Congestion and Topological Properties of Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes

Journal of Parallel and Distributed Computing
Longest fault-free paths in star graphs with vertex faults

Theoretical Computer Science
Longest Fault-Free Paths in Star Graphs with Edge Faults

IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Fault-Tolerant Properties of Generalized Hierarchical Completely-Connected Networks

PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Wide diameter and minimum length of disjoint Menger path systems

Networks
Embedding longest fault-free paths onto star graphs with more vertex faults

Theoretical Computer Science
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges

IEEE Transactions on Computers
Node-disjoint paths in hierarchical hypercube networks

Information Sciences: an International Journal
Graph Theory and Interconnection Networks

Graph Theory and Interconnection Networks
Short containers in Cayley graphs

Discrete Applied Mathematics
An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks

IEEE Transactions on Computers
The super connectivity of exchanged hypercubes

Information Processing Letters
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Quantified Score

Hi-index	5.23

Visualization

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.