One-to-many node-disjoint paths of hyper-star networks

DOI10.1016/j.dam.2012.04.006zbMath1247.68022MaRDI QIDQ442216

Eddie Cheng, Jong-Seok Kim, László Lipták, Sung-Won Kim

Publication date: 10 August 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.006

zbMATH Keywords

algorithms; interconnection network; hyper-star; one-to-many node-disjoint path

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

05C65: Hypergraphs

Related Items

One-to-one disjoint path covers on multi-dimensional tori, Practical application of the stochastic finite element method, Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices, Vertex-disjoint paths joining adjacent vertices in faulty hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Longest fault-free paths in hypercubes with vertex faults
• From Hall's matching theorem to optimal routing on hypercubes
• An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
• Node-disjoint paths in hierarchical hypercube networks
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Strong Rabin numbers of folded hypercubes
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
• Embedding hypercubes, rings, and odd graphs into hyper-stars
• On Disjoint Shortest Paths Routing on the Hypercube
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Optimum broadcasting and personalized communication in hypercubes