One-to-many node-disjoint paths in (n,k)-star graphs

DOI10.1016/J.DAM.2009.08.013MaRDI QIDQ968113zbMATH OpenOpenAlexFDO

Authors Yonghong Xiang, Iain Stewart

Publication date 5 May 2010

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

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

zbMATH Keywords

interconnection networks\((n,k)\)-star graphsone-to-many node-disjoint paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10)

Recommendations

• Node-to-set disjoint paths problem in star graphs
• An efficient algorithm for k-pairwise disjoint paths in star graphs
• scientific article; zbMATH DE number 714464
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• On the construction of all shortest node-disjoint paths in star networks

Cites work

• scientific article; zbMATH DE number 714464 (Why is no real title available?)
• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• Computing and Combinatorics
• Constructing one-to-many disjoint paths in folded hypercubes
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fault-tolerant routing in circulant networks and cycle prefix networks
• From Hall's matching theorem to optimal routing on hypercubes
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Node-to-set disjoint paths problem in star graphs
• THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
• The (n,k)-star graph: A generalized star graph
• Topological properties of the \((n,k)\)-star graph

Cited in

(15)

• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
• Fault-tolerance of (n, k)-star networks
• Maximum independent sets partition of \((n, k)\)-star graphs
• The conditional fault diagnosability of (n, k)-star graphs
• Node-to-set disjoint paths problem in star graphs
• scientific article; zbMATH DE number 714464 (Why is no real title available?)
• Resistance distances in Cayley graphs on symmetric groups
• An efficient algorithm for k-pairwise disjoint paths in star graphs
• One-to-many node-disjoint paths of hyper-star networks
• On the construction of all shortest node-disjoint paths in star networks
• Set-to-set disjoint paths in a folded hypercube
• scientific article; zbMATH DE number 1696433 (Why is no real title available?)
• Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices
• Conditional fault-tolerant routing of \((n,k)\)-star graphs

This page was built for publication: One-to-many node-disjoint paths in \((n,k)\)-star graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968113)