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

DOI10.1016/j.tcs.2012.09.016zbMath1253.68035OpenAlexW1973018026MaRDI QIDQ1929239

Toshinori Takabatake, Tomoki Nakamigawa

Publication date: 7 January 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.016

zbMATH Keywords

containerfault toleranceinterconnection networksnode-disjoint pathsHCC

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Short containers in Cayley graphs
• An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
• The super connectivity of exchanged hypercubes
• Node-disjoint paths in hierarchical hypercube networks
• Wide diameter and minimum length of disjoint Menger path systems
• Fault tolerance properties of pyramid networks
• Node‐disjoint paths and related problems on hierarchical cubic networks
• Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
• An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks
• Longest fault-free paths in star graphs with vertex faults

This page was built for publication: Node-disjoint paths in a level block of generalized hierarchical completely connected networks