1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorTIEN, JYen_US
dc.contributor.authorHO, CTen_US
dc.contributor.authorYANG, WPen_US
dc.date.accessioned2014-12-08T15:04:18Z-
dc.date.available2014-12-08T15:04:18Z-
dc.date.issued1993-11-01en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://dx.doi.org/10.1109/12.247842en_US
dc.identifier.urihttp://hdl.handle.net/11536/2804-
dc.description.abstractIncomplete 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.language.isoen_USen_US
dc.subjectBROADCASTINGen_US
dc.subjectEDGE-DISJOINT SPANNING TREESen_US
dc.subjectINCOMPLETE HYPERCUBESen_US
dc.subjectROUTINGen_US
dc.titleBROADCASTING ON INCOMPLETE HYPERCUBESen_US
dc.typeNoteen_US
dc.identifier.doi10.1109/12.247842en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMPUTERSen_US
dc.citation.volume42en_US
dc.citation.issue11en_US
dc.citation.spage1393en_US
dc.citation.epage1398en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1993MM22100010-
dc.citation.woscount11-
Appears in Collections:Articles


Files in This Item:

  1. A1993MM22100010.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.

Related Contents
Loading...