Cycles in butterfly graphs

Networks

Volumn 35, Issue 2, 2000, Pages 161-171

  Hwang, Shien Ching ^a   Chen, Gen Huey ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Butterfly graph; Cycle partition; Fault tolerant ring embedding; Pancycle

Indexed keywords

EID: 0034148175     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(200003)35:2<161::AID-NET7>3.0.CO;2-Q     Document Type: Article

References (34)

1. [1] S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans Comput 39 (1989), 555-566.
2. [2] F. Annexstein, M. Baumslag, and A.L. Rosenberg, Group action graphs and parallel architectures, SIAM J Comput 19 (1990), 544-569.
3. [3] D. Barth and A. Raspaud, Two edge-disjoint Hamiltonian cycles in the butterfly graph, Info Process Lett 51 (1994), 175-179.
4. [4] J.-C. Bermond, E. Darrot, O. Delmas, and S. Perennes, Hamilton circuits in the directed wrapped butterfly network, Discr Appl Math 84 (1998), 21-42.
5. [5] J.-C. Bermond, E. Darrot, O. Delmas, and S. Perennes, Hamilton cycle decomposition of the butterfly network, Parallel Process Lett 8 (1998), 371-385.
6. [6] S.N. Bhatt, F.R.K. Chung, J.W. Hong, F.T. Leighton, B. Obrenic, A.L. Rosenbeerg, and E.J. Schwabe, Optimal emulations by butterfly-like networks, J ACM 43 (1996), 293-330.
7. [7] L.N. Bhuyan and D.P. Agrawal, Generalized hypercube and hyperbus structures for a computer network, IEEE Trans Comput C-33 (1984), 323-333.
8. [8] J. Bruck, R. Cypher, and C.T. Ho, On the construction of fault-tolerant cube-connected-cycles networks, J Parallel Distrib Comput 25 (1995), 98-106.
9. [9] G.H. Chen, J.S. Fu, and J.F. Fang, Hypercomplete: A pancyclic recursive topology for large-scale distributed multi-computer systems, Networks (to appear).
10. [10] R. Cole, B. Maggs, and R. Sitaraman, Routing on butterfly networks with random faults, Proc IEEE Annual Symp on Foundations of Computer Science, 1995, pp. 558-570.
11. [11] K. Day and A. Tripathi, Embedding of cycles in arrangement graphs, IEEE Trans Comput 12 (1993), 1002-1006.
12. [12] K. Diks and A. Pele, Efficient gossiping by packets in networks with random faults, SIAM J Discr Math 9 (1996), 7-18.
13. [13] A.H. Esfahanian and S.L. Hakimi, Fault-tolerant routing in de Bruijn communication networks, IEEE Trans Comput C-34 (1985), 777-788.
14. [14] R. Feldmann and W. Unger, The cube-connected cycles network is a subgraph of the butterfly network, Parallel Process Lett 2 (1992), 13-19.
15. [15] P. Fragopoulou and S.G. Akl, A parallel algorithm for computing Fourier transform on the star graph, Proc International Conf on Parallel Processing, 1991, pp. 100-106.
16. [16] A. Germa, M.C. Heydemann, and D. Sotteau, Cycles in the cube-connected cycles graph, Discr Appl Math 83 (1998), 135-155.
17. [17] D.S. Greenberg, L.S. Heath, and A.L. Rosenberg, Optimal embeddings of butterfly-like graphs in the hypercube, Math Syst Theory 23 (1990), 61-77.
18. [18] M.C. Heydemann, J.G. Peters, and D. Sotteau, Spanners of hypercube-derived networks, SIAM J Discr Math 9 (1996), 37-54.
19. [19] S.C. Hwang and G.H. Chen, Two problems on butterfly graphs, Proc International Conf on Parallel and Distributed Systems, 1998, pp. 572-579.
20. [20] J.Y. Jou and J.A. Abraham, Fault-tolerant FFT networks, IEEE Trans Comput 37 (1988), 548-561.
21. [21] S. Lakshmivarahan and S.K. Dhall, Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems, McGraw-Hill, New York, 1990.
22. [22] S. Lakshmivarahan, J.S. Jwo, and S.K. Dhall, Embedding of cycles and grids in star graphs, J Circuits Syst Comput 1 (1991), 43-74.
23. [23] F.T. Leighton, Introduction to Parallel Algorithms and Architecture: Arrays-Trees-Hypercubes, Morgan Kaufman, San Mateo, CA, 1992.
24. [24] F.T. Leighton, B.M. Maggs, and R.K. Sitaraman, On the fault tolerance of some popular bounded-degree networks, SIAM J Comput 27 (1998), 1303-1333.
25. [25] A.C. Liang, S. Bhattacharya, and W.T. Tsai, Fault-tolerant multicasting on hypercubes, J Parallel Distrib Comput 23 (1994), 418-428.
26. [26] K. Qiu, H. Meijer, and S. Akl, Decomposing a star graph into disjoint cycles, Info Process Lett 39 (1991), 125-129.
27. [27] A.L. Rosenberg, Cycles in networks, Technical Report UM-CS-1991-020, Department of Computer and Information Science, University of Massachusetts, Amherst, MA, May 14, 1993.
28. [28] Y. Rouskov, S. Latifi, and P.K. Srimani, Conditional fault diameter of star graph networks, J Parallel Distrib Comput 33 (1996), 91-97.
29. [29] R.A. Rowley and B. Bose, Distributed ring embedding in faulty de Bruijn networks, IEEE Trans Comput 46 (1997), 187-190.
30. [30] Y. Saad and M.H. Schultz, Topological properties of hypercubes, IEEE Trans Comput 37 (1988), 867-872.
31. [31] Y.C. Tseng, S.H. Chang, and J.P. Sheu, Fault-tolerant ring embedding in a star graph with both link and node failures, IEEE Trans Parallel Distrib Syst 8 (1997), 1185-1195.
32. [32] S.A. Wong, Hamilton cycles and paths in butterfly graphs, Networks 26 (1995), 145-150.
33. [33] J. Wu, Safety levels - An efficient mechanism for achieving reliable broadcasting in hypercubes, IEEE Trans Comput 44 (1995), 702-706.
34. [34] P.J. Yang, S.B. Tien, and C.S. Raghavendra, Embedding of rings and meshes onto faulty hypercubes using free dimensions, IEEE Trans Comput C-43 (1994), 608-613.