On the Rabin number problem

Networks

Volumn 30, Issue 3, 1997, Pages 219-230

  Duh, Dyi Rong ^a   Chen, Gen Huey ^b  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Circulant networks; Folded hypercubes; Generalized hypercubes; Hierarchical folded hypercube networks; Multicast; Rabin number; WK recursive networks

Indexed keywords

EID: 0040745580     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199710)30:3<219::AID-NET6>3.0.CO;2-O     Document Type: Article

References (34)

1. S. B. Akers, D. Harel, and B. Krishnamurthy. The star graph: An attractive alternative to the n-cube. Proceedings of International Conference on Parallel Processing (1987) 393-400.
2. S. B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks. Proceedings of International Conference on Parallel Processing (1986) 216-223.
3. J. C. Bermond, F. Comellas, and D. F. Hsu, Distributed loop computer networks: A survey. J. Parallel Distrib. Comput. 24(1) (1995) 2-10.
4. L. N. Bhuyan and D. P. Agrawal, Generalized hypercube and hyperbus structures for a computer network. IEEE Trans. Comput. C-33(4) (1984) 323-333.
5. B. Bollobás, Extremal Graph Theory. Academic Press, New York (1978).
6. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. North-Holland, New York (1976).
7. J. Bruck, R. Cypher, and C. T. Ho, Fault-tolerant meshes and hypercubes with minimal numbers of spares. IEEE Trans. Comput. C-42(9) (1993) 1089-1104.
8. G. H. Chen and D. R. Duh, Topological properties, communication, and computation on W K-recursive networks. Networks 24(6) (1994) 303-317.
9. K. Day and A. Tripathi, A comparative study of topological properties of hypercubes and star graphs. IEEE Trans. Parallel Distrib. Syst. 5(1) (1994) 31-38.
10. M. Dietzfelbinger, S. Madhavapeddy, and I. H. Sudborough, Three disjoint path paradigms in star networks. Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing (1991) 400-406.
11. D. Z. Du and D. F. Hsu, Combinatorial Network Theory. Science Press New York Ltd., 1996.
12. D. R. Duh and G. H. Chen, Topological properties of W K-recursive networks. J. Parallel Distrib. Comput. 23(3) (1994) 468-474.
13. D. R. Duh, G. H. Chen, and J. F. Fang, Algorithms and properties of a new two-level network with folded hypercubes as basic modules. IEEE Trans. Parallel Distrib. Syst. 6(7) (1995) 714-723.
14. D. R. Duh, G. H. Chen, and D. F. Hsu, Combinatorial properties of generalized hypercube graphs. Info. Process. Lett. 57(1) (1996) 41-45.
15. S. Dutt and J. P. Hayes, Designing fault-tolerant systems using automorphisms. J. Parallel Distrib. Comput. 12 (1991) 249-268.
16. A. El-Amawy and S. Latifi, Properties and performance of folded hypercubes. IEEE Trans. Parallel Distrib. Syst. 2(1) (1991) 31-42.
17. B. Elspas and J. Turner, Graphs with circulant adjacency matrices. J. Combin. Theory 9 (1970) 297-307.
18. A. J. Frank, L. D. Wittie, and A. J. Bernstein, Multicast communication on network computers. IEEE Software 2(3) (1985) 49-61.
19. Q. Gu and S. Peng, Efficient algorithms for disjoint paths in star graphs. Proceedings of the 6th Transputer/Occam International Conference (1994) 53-65.
20. W. D. Hillis, The Connection Machine. MIT Press, Cambridge, MA (1985).
21. D. F. Hsu, On container width and length in graphs, groups, and networks. IEICE Trans. Fundam. Elect. Commun. Comput. Sci. E77-A(4) (1994) 668-680.
22. D. F. Hsu and Y. D. Lyuu, A graph-theoretical study of transmission delay and fault tolerance. Int. J. Mini Microcomput. 16(1) (1994) 35-42.
23. Z. Jovanovic and J. Misic, Fault tolerance of the star graph interconnection network. Info. Process. Lett. 49 (1994) 145-150.
24. M. S. Krishnamoorthy and B. Krishnamurthy, Fault diameter of interconnection networks. Comput. Math. Appl. 13(5/6) (1987) 577-582.
25. Y. Lan, A. H. Esfahanian, and L. M. Ni, Multicast in hypercube multiprocessors. J. Parallel Distrib. Comput. 8(1) (1990) 30-41.
26. S. Latifi, On the fault-diameter of the star graph. Info. Process. Lett. 46(3) (1993) 143-150.
27. S. C. Liaw, F. Cao, G. J. Chang, and D. F. Hsu, Fault-tolerant routing in circulant networks and cycle prefix networks. Manuscript.
28. X. Lin and L. M. Ni, Multicast communication in multi-computer networks. Proceedings of the International Conference on Parallel Processing, III (1990) 114-118.
29. F. J. Meyer and D. K. Pradhan, Flip-tree: fault-tolerant graphs with wide containers. IEEE Trans. Comput. 37(4) (1988) 472-478.
30. E. T. Ordman, Fault-tolerant networks and graph connectivity. J. Combin. Math. Combin. Comput. 1 (1987) 191-205.
31. M. O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2) (1989) 335-348.
32. Y. Rouskov and P. Srimani, Fault diameter of star graphs. Info. Process. Lett. 48 (1993) 243-251.
33. Y. Saad and M. H. Schultz, Topological properties of hypercubes. IEEE Trans. Comput. C-37(7) (1988) 867-872.
34. G. D. Vecchia and C. Sanges, A recursively scalable network VLSI implementation. Future Gener. Comput. Syst. 4(3) (1988) 235-243.