Routing a permutation in the hypercube by two sets of edge disjoint paths

Journal of Parallel and Distributed Computing

Volumn 44, Issue 2, 1997, Pages 147-152

  Gu, Qian Ping ^a   Tamaki, Hisao ^b  

^a UNIVERSITY OF AIZU   (Japan)

^b MEIJI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031206332     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1358     Document Type: Article

References (17)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, 1994, Efficient routing and scheduling algorithms for optical networks, Proc. of the 5th ACM-SIAM Symposium on Discrete Algorithms, 412, 423.
2. Y. Aumann, Y. Rabani, 1995, Improved bounds for all optical routing, Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 567, 576.
3. Beneš V. E. Mathematical Theory of Connecting Networks and Telephone Traffic. 1965;Academic Press, San Diego.
4. Berge C. Graphs and Hypergraphs. 1973;North-Holland, Amsterdam.
5. Carpinelli J. D., Oruc A. Y. Applications of matching and edge-coloring algorithms to routing in clos networks. Networks. 24:1994;319-326.
6. Choi S. B., Somani A. K. Rearrangeable circuit-switched hypercube architectures for routing permutations. J. Parallel Distrib. Comput. 19:1993;125-130.
7. J. Kleinberg, E. Tardos, 1995, Approximations for the disjoint paths problem in high diameter planar networks, Proc. of the 27th Annual ACM Symposium on the Theory of Computing, 26, 35.
8. J. Kleinberg, E. Tardos, 1995, Disjoint paths in densely embedded graphs, Proc. of the 36th IEEE Symposium on Foundation of Computer Science, 52, 61.
9. 2n. IEEE Trans. Comput. C-34:1985;412-425.
10. Leighton F. T. Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes. 1992;Morgan Kaufmann, San Mateo.
11. Lubiw A. Counterexample to a conjecture of Szymanski on hypercube routing. Inform. Process. Lett. 29:1990;57-61.
12. Nassimi D., Sahni S. Parallel algorithms to set up the Beneš permutation network. IEEE Trans. Comput. C-31:1982;148-154.
13. N. Pippenger, G. Lin, 1992, Fault-tolerant circuit-switching networks, Proc. of the 4th ACM Symposium on Parallel Algorithms and Architectures, 229, 235.
14. P. Raghavan, E. Upfal, 1994, Efficient routing in all-optical networks, Proc. of the 26th ACM Symposium on Theory of Computing, 134, 143.
15. Sprague A. P., Tamaki H. Routings for involutions of a hypercube. Discrete Appl. Math. 48:1994;175-186.
16. Szymanski T. On the permutation capability of a circuit-switched hypercube. Proc. International Conference on Parallel Processing (I). 1989;103-110.
17. Waksman A. A permutation network. J. Assoc. Comput. Mach. 15:1968;159-163.