One-to-many node-disjoint paths of hyper-star networks
From MaRDI portal
Publication:442216
DOI10.1016/J.DAM.2012.04.006zbMATH Open1247.68022OpenAlexW2154837657MaRDI QIDQ442216FDOQ442216
Authors: L. Lipták, Eddie Cheng, Jong-Seok Kim, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Node-disjoint paths in hierarchical hypercube networks
- Longest fault-free paths in hypercubes with vertex faults
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
- Optimum broadcasting and personalized communication in hypercubes
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Structural properties of hyper-stars.
- Embedding hypercubes, rings, and odd graphs into hyper-stars
- From Hall's matching theorem to optimal routing on hypercubes
- An efficient algorithm for the \(k\)-pairwise disjoint paths problem in hypercubes
- Strong Rabin numbers of folded hypercubes
- Title not available (Why is that?)
- On Disjoint Shortest Paths Routing on the Hypercube
- Title not available (Why is that?)
Cited In (6)
- Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
- ONE-TO-MANY NODE MATCHING BETWEEN COMPLEX NETWORKS
- One-to-one disjoint path covers on multi-dimensional tori
- Practical application of the stochastic finite element method
- Set-to-set disjoint paths in a folded hypercube
- Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices
This page was built for publication: One-to-many node-disjoint paths of hyper-star networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442216)
