Strong Rabin numbers of folded hypercubes

Theoretical Computer Science

Volumn 341, Issue 1-3, 2005, Pages 196-215

  Lai, Cheng Nan ^a   Chen, Gen Huey ^b  

^a NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Folded hypercube; Hypercube; Node disjoint paths; Optimization problem; Strong Rabin number

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

FOLDED HYPERCUBES; HYPERCUBES; NODE-DISJOINT PATHS; OPTIMIZATION PROBLEMS; STRONG RABIN NUMBER;

NUMBER THEORY;

EID: 23844513092     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.02.010     Document Type: Article

References (18)

1. B. Bollobás Extremal graph Theory 1978 Academic Press New York
2. J.A. Bondy, and U.S.R. Murthy Graph Theory with Applications 1976 North-Holland New York
3. F. Cao, D.Z. Du, D.F. Hsu, and S.H. Teng Fault tolerance properties of pyramid networks IEEE Trans. Comput. 48 1 1999 88 93
4. C.C. Chen, and J. Chen Nearly optimal one-to-many parallel routing in star networks IEEE Trans. Paral. Distr. Systems 8 12 1997 1196 1202
5. D.R. Duh, and G.H. Chen On the Rabin number problem Networks 30 3 1997 219 230
6. A. El-Amawy, and S. Latifi Properties and performance of folded hypercubes IEEE Trans. Paral. Distr. Systems 2 1 1991 31 42
7. S. Gao, D.F. Hsu, Short containers in Cayley graphs, DIMACS Technical Report 2001-18, 2001.
8. S. Gao, and B. Novick From Hall's matching theorem to optimal routing J. Combin. Theory Ser. B 74 1998 291 301
9. D.F. Hsu On container width and length in graphs, groups, and networks IEICE Trans. Fund. Electron. Commun. Comput. Sci. E77-A 4 1994 668 680
10. 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
11. C.N. Lai, One-to-many disjoint paths in the hypercube and folded hypercube, Ph.D. Thesis, Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, 2001 (also available at http://www.csie.ntu.edu.tw/~ghchen ).
12. C.N. Lai, G.H. Chen, and D.R. Duh Constructing one-to-many disjoint paths in folded hypercubes IEEE Trans. Comput. 51 1 2002 33 45
13. S.C. Liaw, and G.J. Chang Generalized diameters and Rabin numbers of networks J. Combin. Optim. 4 1999 371 384
14. S.C. Liaw, and G.J. Chang Rabin numbers of butterfly networks Discrete Math. 196 1999 219 227
15. S.C. Liaw, and G.J. Chang Wide diameters of butterfly networks Taiwanese J. Math. 3 1 1999 83 88
16. C.H. Lu, and K.M. Zhang On container length and wide-diameter in unidirectional hypercubes Taiwanese J. Math. 6 1 2002 75 87 (also available at http://www.math.nthu.edu.tw/tjm/ )
17. M.O. Rabin Efficient dispersal of information for security, load balancing, and fault tolerance J. ACM 36 2 1989 335 348
18. Y. Saad, and M.H. Schultz Topological properties of hypercubes IEEE Trans. Comput. 37 7 1988 867 872