On Disjoint Shortest Paths Routing on the Hypercube

DOI10.1007/978-3-642-02026-1_35MaRDI QIDQ3637084zbMATH OpenOpenAlexFDO

Authors Eddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_35

zbMATH Keywords

disjoint shortest pathsrouting algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1161303
• scientific article; zbMATH DE number 219253
• An algorithm on disjoint paths in enhanced hypercubes
• An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
• Many-to-many disjoint paths in hypercubes with faulty vertices

Cited in

(20)

• Symmetric routings of the hypercube
• Routing a permutation in the hypercube by two sets of edge disjoint paths
• From Hall's matching theorem to optimal routing on hypercubes
• An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
• Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
• Multicolor routing in the undirected hypercube
• An efficient construction of one-to-many node-disjoint paths in folded hypercubes
• Simultaneous disjoint routing in regular graphs
• A routing solution of FC_n
• Routing multiple paths in hypercubes
• scientific article; zbMATH DE number 140114 (Why is no real title available?)
• scientific article; zbMATH DE number 1240772 (Why is no real title available?)
• scientific article; zbMATH DE number 1161303 (Why is no real title available?)
• One-to-many node-disjoint paths of hyper-star networks
• scientific article; zbMATH DE number 1475207 (Why is no real title available?)
• An algorithm on disjoint paths in enhanced hypercubes
• scientific article; zbMATH DE number 219253 (Why is no real title available?)
• Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
• Pairwise edge disjoint shortest paths in the \(n\)-cube
• On the construction of all shortest node-disjoint paths in star networks

This page was built for publication: On Disjoint Shortest Paths Routing on the Hypercube

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