Show simple item record

dc.contributor.author陈宝兴
dc.contributor.author肖文俊
dc.date.accessioned2017-11-14T02:51:12Z
dc.date.available2017-11-14T02:51:12Z
dc.date.issued2003-01-30
dc.identifier.citation厦门大学学报(自然科学版),2003,(01):19-25
dc.identifier.issn0438-0479
dc.identifier.otherXDZK200301005
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/154831
dc.description.abstract利用环状网络(Loopnetworks)到超圆环面的两种嵌入及环状网络的最优路由算法,给出了一种新的超圆环面的快速路由算法,其时间复杂性仅为O(D)(这里D为网络的直径).当r≥2时,此算法得到的任两个结点的路径长度path_long≤[cr/2]+[kc/2]+1.特别地,当r≥2,c≥8时,path_long≤D+1.
dc.description.abstractIn this paper, by using two embeddings of loop networks into the supertoroidal networks and an optimal routing for the loop networks, we give an O(D) time fast routing algorithm for supertoroidal networks(where D is the diameter of the networks). We also show that if r≥2 and c≥8, the length of the path between any two nodes given by our algorithm is not more than D+1.
dc.description.sponsorship漳州师院科研经费资助
dc.language.isozh_CN
dc.subjectCayley图
dc.subject超圆环面
dc.subject路由
dc.subjectCayley graph
dc.subjectsupertoroidal networks
dc.subjectrouting
dc.title超圆环面的一种快速路由算法
dc.title.alternativeA Fast Routing Algorithm for Supertoroidal Networks
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record