On disjoint shortest paths routing in interconnection networks: a case study in the star graph

MaRDI QIDQ5405474zbMATH OpenFDO

Authors

Publication date 2 April 2014

zbMATH Keywords

algorithmsdisjoint pathparallel and distributed computing

Mathematics Subject Classification ID

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

Recommendations

• On the construction of all shortest node-disjoint paths in star networks
• scientific article; zbMATH DE number 714464
• scientific article; zbMATH DE number 1161303
• scientific article; zbMATH DE number 1439419
• An efficient algorithm for k-pairwise disjoint paths in star graphs

Cited in

(8)

• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• A routing solution of \(FC_n\)
• Study of general incomplete star interconnection networks
• scientific article; zbMATH DE number 714464 (Why is no real title available?)
• scientific article; zbMATH DE number 1548173 (Why is no real title available?)
• Simultaneous disjoint routing in regular graphs
• On the construction of all shortest node-disjoint paths in star networks
• The number of shortest paths in the \((n, k)\)-star graph

This page was built for publication: On disjoint shortest paths routing in interconnection networks: a case study in the star graph

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