完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Kung, Tzu-Liang | |
| dc.contributor.author | Liang, Tyne | |
| dc.contributor.author | Hsu, Lih-Hsing | |
| dc.date.accessioned | 2009-06-02T07:05:55Z | |
| dc.date.accessioned | 2020-05-25T06:49:03Z | - |
| dc.date.available | 2009-06-02T07:05:55Z | |
| dc.date.available | 2020-05-25T06:49:03Z | - |
| dc.date.issued | 2009-02-12T01:41:03Z | |
| dc.date.submitted | 2009-02-12 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/11200 | - |
| dc.description.abstract | The problem of finding the maximum number of edgedisjoint spanning trees arises from the need for developing efficient collective communication algorithms in distributed memory parallel computers. In this paper, we propose a formula for obtaining the maximum number of edge-disjoint undirected spanning trees on the wrapped butterfly network. The result can be applied to design efficient multicast routing algorithms in wormhole-routed parallel systems. | |
| dc.description.sponsorship | 淡江大學，台北縣 | |
| dc.format.extent | 6p. | |
| dc.relation.ispartofseries | 2008 ICS會議 | |
| dc.subject | Interconnection network | |
| dc.subject | Graph | |
| dc.subject | Butterfly network | |
| dc.subject | Spanning tree | |
| dc.subject.other | Workshop of Peer to Peer | |
| dc.title | Edge-disjoint Undirected Spanning Trees on the Wrapped Butterfly Networks | |
| 分類: | 2008年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002008000143.pdf | 762.83 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。