完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | 唐學明 等 | |
| dc.date.accessioned | 2009-06-02T08:42:38Z | |
| dc.date.accessioned | 2020-07-05T06:32:58Z | - |
| dc.date.available | 2009-06-02T08:42:38Z | |
| dc.date.available | 2020-07-05T06:32:58Z | - |
| dc.date.issued | 2006-06-12T08:36:16Z | |
| dc.date.submitted | 2003-12-19 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2376/1865 | - |
| dc.description.abstract | Two spanning trees of a given graph G are said to be independent if they are rooted at the same vertex r to v,one path in each tree, are internally disjoint. A set of spanning trees of G is said to be independent if they are pairwise independent. A recursive circulant graph R(N.d) has N=cdm vertices.... | |
| dc.description.sponsorship | 逢甲大學,台中市 | |
| dc.format.extent | 8P. | |
| dc.format.extent | 273174 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 中華民國92年全國計算機會議 | |
| dc.subject | recursive circulant graphs | |
| dc.subject | independent spanning trees | |
| dc.subject | internally disjoint paths | |
| dc.subject | fault tolerant broadcasting | |
| dc.subject.other | 網路和IPv6 | |
| dc.title | Independent Spanning Trees on Recursive Circulant Graphs | |
| dc.title.alternative | 遞迴環形圖上獨立擴展樹之建構 | |
| 分類: | 2003年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| NT_0062003194.pdf | 266.77 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。