Research NoteRouting a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths☆
References (18)
- et al.
Rearrangeable circuit-switched hypercube architectures for routing permutations
J. Parallel Distrib. Comput.
(1993) Counterexample to a conjecture of Szymanski on hypercube routing
Inform. Process. Lett.
(1990)- et al.
Routings for involutions of a hypercube
Discrete Appl. Math.
(1994) - A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, 1994, Efficient routing and scheduling...
- Y. Aumann, Y. Rabani, 1995, Improved bounds for all optical routing, Proc. of the 6th Annual ACM–SIAM Symposium on...
Mathematical Theory of Connecting Networks and Telephone Traffic
(1965)Graphs and Hypergraphs
(1973)- et al.
Applications of matching and edge-coloring algorithms to routing in clos networks
Networks
(1994)
There are more references available in the full text version of this article.
Cited by (24)
Embedding multidimensional grids into optimal hypercubes
2014, Theoretical Computer Science2-1 routing requests in the hypercube
2005, Electronic Notes in Discrete MathematicsComplexity of pairwise shortest path routing in the grid
2004, Theoretical Computer ScienceOptimal broadcasting in injured hypercubes using directed safety levels
2003, Journal of Parallel and Distributed ComputingThe permutation-path coloring problem on trees
2003, Theoretical Computer ScienceRouting permutations and 2-1 routing requests in the hypercube
2001, Discrete Applied Mathematics
- ☆
This work was partially supported by the Founding of Group Research Projects at The University of Aizu.
- 2
E-mail: [email protected].
- 3
E-mail: [email protected]
Copyright © 1997 Academic Press. All rights reserved.