From Hall's Matching Theorem to Optimal Routing on Hypercubes

Journal of Combinatorial Theory. Series B

Volumn 74, Issue 2, 1998, Pages 291-301

  Gao, Shuhong ^a   Novick, Beth ^a   Qiu, Ke ^b  

^a CLEMSON UNIVERSITY   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0008195250     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1850     Document Type: Article

References (7)

1. Bondy J. A., Murty U. S. R. Graph Theory with Applications. 1976;Macmillan, London.
2. Galil Z. Efficient algorithms for finding maximal matchings in graphs. ACM Comput. Surveys. 18:1986;23-38.
3. Hall P. On representatives of subsets. J. London Math. Soc. 10:1935;26-30.
4. Hsu D. F. On container width and length in graphs, groups, and networks. IEICE Trans. Fund. Electron. Comm. Comput. Sci. E77-A:1994;668-680.
5. Leighton F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. 1992;Morgan Kaufmann, San Mateo.
6. Qiu K., Novick B. Disjoint paths in hypercubes. Congr. Numer. 119:1996;105-112.
7. Rabin M. Efficient dispersal of information for security, load balancing, and fault tolerance. J. Assoc. Comput. Mach. 36:1989;335-348.