𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two conditions for reducing the maximal length of node-disjoint paths in hypercubes

✍ Scribed by Cheng-Nan Lai


Book ID
113927592
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
370 KB
Volume
418
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Routing a Permutation in the Hypercube b
✍ Qian-Ping Gu; Hisao Tamaki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 95 KB

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths.