One-to-many node-disjoint paths of hyper-star networks
From MaRDI portal
Publication:442216
DOI10.1016/j.dam.2012.04.006zbMath1247.68022OpenAlexW2154837657MaRDI 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
Related Items
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, One-to-one disjoint path covers on multi-dimensional tori
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