完整後設資料紀錄
DC 欄位語言
dc.contributor.authorTang, Shyue-Ming Jr
dc.contributor.authorWang, Yue-Li Jr
dc.date.accessioned2011-03-06T19:32:25Z
dc.date.accessioned2020-05-18T03:22:04Z-
dc.date.available2011-03-06T19:32:25Z
dc.date.available2020-05-18T03:22:04Z-
dc.date.issued2011-03-06T19:32:25Z
dc.date.submitted2009-11-28
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/30036-
dc.description.abstractIn 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.sponsorshipNational Taipei University,Taipei
dc.format.extent6p.
dc.relation.ispartofseriesNCS 2009
dc.subjectinterconnection network,
dc.subjectvertex-symmetric graphs
dc.subjectcirculant graphs
dc.subjectrecursive circulant graphs
dc.subjectgraph algorithm
dc.subject.otherWorkshop on Algorithms and Bioinformatics
dc.titleGeneralized Recursive Circulant Graphs
分類:2009年 NCS 全國計算機會議

文件中的檔案:
檔案 描述 大小格式 
AB 3-2.pdf2.29 MBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。