Three disjoint path paradigms in star networks

Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991

Volumn , Issue , 1991, Pages 400-406

  Dietzfelbinger, M ^a   Madhavapeddy, S ^b   Sudborough, I H ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISJOINT PATHS; HYPER-CUBES; NODE DEGREE; OPTIMAL ALGORITHM; RECURSIVE STRUCTURE; STAR GRAPHS; STAR NETWORK;

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING);

EID: 85027136094     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPDP.1991.218213     Document Type: Conference Paper

References (23)

1. [AB90] F. Annextein and M. Baumslag. A unified approach to off-line permutation routing on parallel networks. 2nd A CM Symposium on Parallel Algorithms and Architectures, pages 398-406, 1990.
2. [AHK87] S. B. Akers, D. Harel, and B. Krishna-murthy. The star graph: An attractive alternative to the n-cube. International Conference on Parallel Processing, pages 393-400, 1987.
3. [AK84] S. B. Akers and B. Krishnamurthy. Group graphs as interconnection networks. 14th International Conference on Fault Tolerant Computing, pages 422-427, 1984.
4. [AK89] S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers, (Vol. 38):555-565, 1989.
5. [BCGS91] S. Bettayeb, B. Cong, M. Girou, and I. H. Sudborough. Embedding star networks into hypercubes. Preprint, Computer Science Program, Univ. of Texas at Dallas, 1991.
6. [Con91] B. Cong. Optimum simulation among parallel computer networks. Doctoral Dissertation, Computer Science Program, University of Texas at Dallas, 1991.
7. [DM] M. Dietzfelbinger and S. Madhavapeddy. manuscript.
8. [GJ] M. R. Garey and D. S. Johnson. Comput-ers and intractability: A guide to the theory of np-completeness. W. H. Freeman and Company, New York.
9. [Har] F. Harary. Graph theory. Academic Press.
10. [HLN89] J. Hastad, F. T. Leighton, and M. Newman. Fast computation using faulty hypercubes. 21st ACM Symposium on Theory of Computing, pages 251-263, 1989.
11. [JLD90] J. Jwo, S. Laksmivarahan, and S. K. Dhall. Embedding of cycles and grids in star graphs. 2nd IEEE Symposium on Parallel and Distributed Processing, pages 540-547, 1990.
12. [Kar] R. M. Karp. On the computational com-plexity of combinatorial problems. Networks, (5:):45-68.
13. [MPS91] Z. Miller, D. Pritikin, and I. H. Sudborough. Small dilation embeddings of hypercubes into star networks. Preprint, Computer Science Program, Univ. of Texas at Dallas, 1991.
14. [MS90a] S. Madhavapeddy and I. H. Sudborough. Deterministic message routing in faulty hy-percubes. 16th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 154-169, 1990.
15. [MS90b] S. Madhavapeddy and I. H. Sudborough. A topological property of hypercubes: Node disjoint paths. 2nd IEEE Symposium on Parallel and Distributed Processing, pages 532-539, 1990.
16. [Nag91] ,J. Nagarajarao. Embedding of complete binary trees and x-trees into star networks. Masters Thesis, Computer Science Program, University of Texas at Dallas, 1991.
17. [NSK90] M. Nigam, S. Sahni, and B. Krishna-murthy. Embedding hamiltonians and hypercubes in star interconnection graphs. International Conference on Parallel Processing, 1990.
18. [PRW90] M. Palis, S. Rajasekaran, and D. Wei. General routing algorithms for star graphs and leveled networks. 4th International Parallel Processing Symposium, California, pages 597-611, 1990.
19. [Rab89] M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the Association for Computing Machinery, (Vol. 36, No. 2):335-348, April 1989.
20. [RS86] N. Robertson and P. Seymour. Graph minors xiii. the disjoint paths problem. manuscript, 1986.
21. [Shi] Y. Shiloach. The two paths problem is polynomial. Technical Report STAN-CS-78-654, Stanford University.
22. [SS88] Y. Saad and M. H. Schultz. Topological properties of hypercubes. IEEE Transactions on Computers, (Vol. 37, No. 7):867-872, July 1988.
23. [Wat68] M. Watkins. On the existence of certain disjoint arcs in graphs. Duke Math. Journal, 1968.