Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | YUAN, SM | en_US |
dc.date.accessioned | 2014-12-08T15:05:18Z | - |
dc.date.available | 2014-12-08T15:05:18Z | - |
dc.date.issued | 1991-03-14 | en_US |
dc.identifier.issn | 0020-0190 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/0020-0190(91)90215-4 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/3838 | - |
dc.description.abstract | The 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.iso | en_US | en_US |
dc.subject | FAULT-TOLERANT NETWORKS | en_US |
dc.subject | PARALLEL PROCESSING | en_US |
dc.subject | GRAPH THEORY | en_US |
dc.subject | CONNECTIVITY | en_US |
dc.subject | DIAMETER | en_US |
dc.subject | NODE-DISJOINT PATH | en_US |
dc.title | TOPOLOGICAL PROPERTIES OF SUPERCUBE | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/0020-0190(91)90215-4 | en_US |
dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
dc.citation.volume | 37 | en_US |
dc.citation.issue | 5 | en_US |
dc.citation.spage | 241 | en_US |
dc.citation.epage | 245 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:A1991FF07800001 | - |
dc.citation.woscount | 14 | - |
Appears in Collections: | Articles |
Files in This Item:
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.