Strong Rabin numbers of folded hypercubes

DOI10.1016/j.tcs.2005.02.010zbMath1102.68096OpenAlexW2074233207MaRDI QIDQ2566009

Gen-Huey Chen, Cheng-Nan Lai

Publication date: 22 September 2005

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

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

zbMATH Keywords

Optimization problemNode-disjoint pathsFolded hypercubeStrong Rabin number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Node-disjoint paths in hierarchical hypercube networks ⋮ One-to-many node-disjoint paths of hyper-star networks ⋮ On conditional diagnosability of the folded hypercubes ⋮ \(\omega \)-wide diameters of enhanced pyramid networks ⋮ Fault-free cycles in folded hypercubes with more faulty elements ⋮ Some results on topological properties of folded hypercubes ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Short containers in Cayley graphs
• Generalized diameters and Rabin numbers of networks
• Rabin numbers of Butterfly networks
• Wide diameters of butterfly networks
• From Hall's matching theorem to optimal routing on hypercubes
• On container length and wide-diameter in undirectional hypercubes
• Efficient dispersal of information for security, load balancing, and fault tolerance
• On the Rabin number problem
• Constructing one-to-many disjoint paths in folded hypercubes
• Fault tolerance properties of pyramid networks