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

DOI10.1016/J.DAM.2012.04.006MaRDI QIDQ442216zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmsinterconnection networkhyper-starone-to-many node-disjoint path

Mathematics Subject Classification ID

Hypergraphs (05C65) Network design and communication in computer systems (68M10)

Recommendations

• On the construction of all shortest node-disjoint paths in star networks
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Node-disjoint paths in hierarchical hypercube networks
• scientific article; zbMATH DE number 714464
• Node-to-set disjoint paths problem in star graphs

Cites work

• scientific article; zbMATH DE number 5139532 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1983293 (Why is no real title available?)
• An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Embedding hypercubes, rings, and odd graphs into hyper-stars
• From Hall's matching theorem to optimal routing on hypercubes
• Longest fault-free paths in hypercubes with vertex faults
• Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
• Node-disjoint paths in hierarchical hypercube networks
• On Disjoint Shortest Paths Routing on the Hypercube
• Optimum broadcasting and personalized communication in hypercubes
• Strong Rabin numbers of folded hypercubes
• Structural properties of hyper-stars.

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)