Multi-color routing in the undirected hypercube

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1350, Issue , 1997, Pages 72-81

  Gu, Qian Ping ^a   Tamaki, Hisao ^b  

^a UNIVERSITY OF AIZU   (Japan)

^b MEIJI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HYPERCUBE; MAXIMUM DEGREE; MULTI-COLORS; N-DIMENSIONAL HYPERCUBE; ROUTING PROBLEMS; UNDIRECTED GRAPH;

COLOR;

EID: 0347622797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_9     Document Type: Conference Paper

References (13)

1. A. Aggarwal and A. Bar-Noy and D. Coppersmith and R. Ramaswami and B. Schieber and M. Sudan. Efficient Routing and Scheduling Algorithms for Optical Networks. Proc. of the 5th A CM-SIAM Symposium on Discrete Algorithms, pages 412-423, 1994.
2. Y. Aumann and Y. Rabani. Improved bounds for all optical routing. In Proc. Of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 567-576, 1995.
3. V.E. Benes. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965.
4. C. Berge. Graphs and Hypergraphs. North-Holland, 1973.
5. S.B. Choi and A.K. Somani. Rearrangeable circuit-switched hypercube architectures for routing permutations. J. of Parallel and Distributed Computing, 19:125-130, 1993.
6. Q.P. Gu and H. Tamaki. Routing a permutation in the hypercube by two sets of edge-disjoint paths. Proc. of the 10th International Parallel Processing Symposium, IPPS'96, April 1996
7. F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays. Trees Hypercubes. Morgan Kaufmann, 1992.
8. A. Lubiw. Counterexample to a Conjecture of Szymanski on Iypercube Routing. Information Processing Letters, 29:57-61, 1990.
9. D. Nassimi and S. Sahni. Parallel algorithms to set up the Benes" permutation network. IEEE Trans. on Comput., C-31:148-154, 1982.
10. P. Raghavan and E. IJpfal Efficient Routing in All-Optical Networks In Proc. of the 26th ACM Symposium on Theory of Computing, pages 134-143, 1994.
11. Y. Rabani. Path coloring on the mesh. In Proc. of the 37th IEEE Symposium on Foundations of Computer Sciences (FOCS'96), pages 400-409, 1996.
12. A.P. Sprague and H. Tamaki. Routings for involutions of a hypercube. Discrete Applied Math., 48:175-186, 1994.
13. T. Szymanski. On the permutation capability of a circuit-switched hypercube. In Proc. International Conference on Parallel Processing (I), pages 103-110, 1989