完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Tang, Shyue-Ming Jr | |
dc.contributor.author | Wang, Yue-Li Jr | |
dc.date.accessioned | 2011-03-06T19:32:25Z | |
dc.date.accessioned | 2020-05-18T03:22:04Z | - |
dc.date.available | 2011-03-06T19:32:25Z | |
dc.date.available | 2020-05-18T03:22:04Z | - |
dc.date.issued | 2011-03-06T19:32:25Z | |
dc.date.submitted | 2009-11-28 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/30036 | - |
dc.description.abstract | In this paper, we propose a new class of graphs called generalized recursive circulant graphs (GRCGs for short). As it is named, GRCGs are a generalization of recursive circulant graphs. This generalization is achieved by using a multidimensional vertex labeling scheme. Various network metrics of GRCGs, such as degree, connectivity and hamiltonian properties are studied. A shortest path routing algorithm for GRCGs is also proposed in this paper. | |
dc.description.sponsorship | National Taipei University,Taipei | |
dc.format.extent | 6p. | |
dc.relation.ispartofseries | NCS 2009 | |
dc.subject | interconnection network, | |
dc.subject | vertex-symmetric graphs | |
dc.subject | circulant graphs | |
dc.subject | recursive circulant graphs | |
dc.subject | graph algorithm | |
dc.subject.other | Workshop on Algorithms and Bioinformatics | |
dc.title | Generalized Recursive Circulant Graphs | |
分類: | 2009年 NCS 全國計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
AB 3-2.pdf | 2.29 MB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。