完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Lin, Chin-Tsai | |
| dc.date.accessioned | 2009-08-23T04:41:17Z | |
| dc.date.accessioned | 2020-05-25T06:37:54Z | - |
| dc.date.available | 2009-08-23T04:41:17Z | |
| dc.date.available | 2020-05-25T06:37:54Z | - |
| dc.date.issued | 2006-10-16T03:39:43Z | |
| dc.date.submitted | 2002-12-18 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1447 | - |
| dc.description.abstract | In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees on the alternating group graph. The paths that route from the common root node to any given node through different spanning trees are node-disjoint. This graph can be used to derive fault tolerant algorithms for the broadcasting and scattering problems under the all port communication model. | |
| dc.description.sponsorship | 東華大學,花蓮縣 | |
| dc.format.extent | 21p. | |
| dc.format.extent | 205432 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2002 ICS會議 | |
| dc.subject | Interconnection networks | |
| dc.subject | alternating group graphs | |
| dc.subject | node-disjoint | |
| dc.subject | paths | |
| dc.subject | edge-disjoint spanning trees | |
| dc.subject.other | Computer Systems | |
| dc.title | Embedding Edge-Disjoint Spanning Trees on the Alternating Group Graphs | |
| 分類: | 2002年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002002000017.PDF | 200.62 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。