DocumentCode
293694
Title
A homomorphism of the de Bruijn graphs and its applications
Author
Chen, Chi-Chang ; Chen, Jianer
Author_Institution
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
Volume
1
fYear
1995
fDate
19-21 Apr 1995
Firstpage
465
Abstract
In this paper, we present a homomorphism from a higher dimensional de Bruijn graph to a lower dimensional de Bruijn graph. This homomorphism is simple and efficient. Applications of this homomorphism on embedding the large size complete binary trees, rings, and shuffle-exchange networks to the smaller binary de Bruijn networks are presented
Keywords
graph theory; multiprocessor interconnection networks; complete binary trees; de Bruijn graphs; embedding; homomorphism; rings; shuffle-exchange networks; Application software; Binary trees; Broadcasting; Computational modeling; Computer science; Fault tolerance; Length measurement; Multiprocessor interconnection networks; Q measurement; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Algorithms and Architectures for Parallel Processing, 1995. ICAPP 95. IEEE First ICA/sup 3/PP., IEEE First International Conference on
Conference_Location
Brisbane, Qld.
Print_ISBN
0-7803-2018-2
Type
conf
DOI
10.1109/ICAPP.1995.472219
Filename
472219
Link To Document