BROADCASTING ON INCOMPLETE HYPERCUBES
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1398 | en_US |
dc.citation.issue |
11 | en_US |
dc.citation.spage |
1393 | en_US |
dc.citation.volume |
42 | en_US |
dc.citation.woscount |
11 | |
dc.contributor.author |
TIEN, JY | en_US |
dc.contributor.author |
HO, CT | en_US |
dc.contributor.author |
YANG, WP | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:04:18Z | |
dc.date.available |
2014-12-08T15:04:18Z | |
dc.date.issued |
1993-11-01 | en_US |
dc.description.abstract |
Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. In this correspondence, we devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2n + 2k nodes, where 0 less-than-or-equal-to k less-than-or-equal-to n. The broadcasting algorithm is strictly optimal. | en_US |
dc.identifier.doi |
10.1109/12.247842 | en_US |
dc.identifier.issn |
0018-9340 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON COMPUTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/12.247842 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/2804 | |
dc.identifier.wosnumber |
WOS:A1993MM22100010 | |
dc.language.iso |
en_US | en_US |
dc.subject |
BROADCASTING | en_US |
dc.subject |
EDGE-DISJOINT SPANNING TREES | en_US |
dc.subject |
INCOMPLETE HYPERCUBES | en_US |
dc.subject |
ROUTING | en_US |
dc.title |
BROADCASTING ON INCOMPLETE HYPERCUBES | en_US |
dc.type |
Note | en_US |
檔案
- A1993MM22100010.pdf (708.3 KB, Adobe PDF)
所屬典藏: 期刊論文