{"title":"de Bruijn图的同态及其应用","authors":"Chi-Chang Chen, Jianer Chen","doi":"10.1109/ICAPP.1995.472219","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A homomorphism of the de Bruijn graphs and its applications\",\"authors\":\"Chi-Chang Chen, Jianer Chen\",\"doi\":\"10.1109/ICAPP.1995.472219\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A homomorphism of the de Bruijn graphs and its applications
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.<>