完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYUAN, SMen_US
dc.date.accessioned2014-12-08T15:05:18Z-
dc.date.available2014-12-08T15:05:18Z-
dc.date.issued1991-03-14en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://dx.doi.org/10.1016/0020-0190(91)90215-4en_US
dc.identifier.urihttp://hdl.handle.net/11536/3838-
dc.description.abstractThe N-node Supercube is a new generalized of Hypercube topology. Unlike the Binary Hypercube, the Supercube can be constructed for any number of nodes N. In addition, it maintains the connectivity and diameter properties of the corresponding hypercube. In this paper, we examine some topological properties of the Supercube from the graph-theory point of view.en_US
dc.language.isoen_USen_US
dc.subjectFAULT-TOLERANT NETWORKSen_US
dc.subjectPARALLEL PROCESSINGen_US
dc.subjectGRAPH THEORYen_US
dc.subjectCONNECTIVITYen_US
dc.subjectDIAMETERen_US
dc.subjectNODE-DISJOINT PATHen_US
dc.titleTOPOLOGICAL PROPERTIES OF SUPERCUBEen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/0020-0190(91)90215-4en_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume37en_US
dc.citation.issue5en_US
dc.citation.spage241en_US
dc.citation.epage245en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1991FF07800001-
dc.citation.woscount14-
顯示於類別:期刊論文


文件中的檔案:

  1. A1991FF07800001.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。