Performance Analysis for Dynamic Tree Embedding ink-Partite Networks by a Random Walk

Journal of Parallel and Distributed Computing

Volumn 50, Issue 1-2, 1998, Pages 144-156

  Shen, Hong ^a   Li, K ^b   Pan, Y ^c   Young, G H ^d   Zheng, S Q ^e  

^a GRIFFITH UNIVERSITY   (Australia)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c University of Dayton   (United States)

^d CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^e Louisiana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. Aiello W., Leighton F. T. Coding theory, hypercube embeddings, and fault tolerance. Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures. 1991.
2. Bhatt S., Cai J.-Y. Taking random walks to grow trees in hypercubes. J. Assoc. Comput. Mach. 40:1993;741-764.
3. Bhatt S., Greenberg D., Leighton T., Liu P. Tight bounds for on-line tree embeddings. Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms. 1991;. p. 344-350.
4. Harary F. Graph Theory. 1969;Addison-Wesley, Reading.
5. Karp R. M., Zhang Y. Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. Assoc. Comput. Mach. 40:1993;765-789.
6. Leighton F. T., Newman M. J., Ranade A. G., Schwabe E. J. Dynamic tree embeddings in butterflies and hypercubes. SIAM J. Comput. 21:1992;639-654.
7. Li K. Maintenance of tree structured computations on parallel and distributed computer systems. Proceedings of the 11th ACM Symposium on Applied Computing. February 1996;. p. 337-343.
8. Li K. On dynamic tree growing in hypercubes. Proceedings of the 12th ACM Symp. on Applied Computing. February 1997.
9. Li K., Pan Y., Shen H., Young G. H., Zheng S. Q. Lower Bounds for Dynamic Tree Embedding in Bipartite Networks. Technical Report. Dec. 1996.
10. Ranade A. G. Optimal speedup for backtrack search on a butterfly network. Proc. of the 3rd ACM Symp. on Parallel Algorithms and Architectures. 1991;. p. 40-48.
11. Zheng S. Q., Li K., Pan Y., Shen H., Young G. H. On Equal Chromatic Partition of Networks. Technical Report. Dec. 1996.