On Disjoint Shortest Paths Routing on the Hypercube

DOI10.1007/978-3-642-02026-1_35zbMath1246.05147OpenAlexW1566919978MaRDI QIDQ3637084

Eddie Cheng, Ke Qiu, Shuhong Gao, 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

routing algorithmdisjoint shortest paths

Mathematics Subject Classification ID

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

Related Items (2)

One-to-many node-disjoint paths of hyper-star networks ⋮ Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

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