Graph embedding aspect of IEH graphs
| dc.citation.epage | 33 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 23 | en_US |
| dc.citation.volume | 17 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | Chang, HY | en_US |
| dc.contributor.author | Chen, RJ | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:44:28Z | |
| dc.date.available | 2014-12-08T15:44:28Z | |
| dc.date.issued | 2001-01-01 | en_US |
| dc.description.abstract | In order to overcome the drawback of the hypercube that the number of nodes is limited to a power of two, the incrementally extensible hypercube (IEH) graph is derived for an arbitrary number of nodes [12]. In this paper, we first prove that the incomplete hypercube (IH) is a spanning subgraph of IEH. Next. we present a new method to construct an IEH From an IH. From the aspect of graph embedding, we determine the minimum size of the IEH that contains a complete binary tree. WI: then embed a torus (with a side length as power of two) into an IEH with dilation 1 and expansion 1. | en_US |
| dc.identifier.issn | 1016-2364 | en_US |
| dc.identifier.journal | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/30035 | |
| dc.identifier.wosnumber | WOS:000167680200002 | |
| dc.language.iso | en_US | en_US |
| dc.subject | hypercubes | en_US |
| dc.subject | embedding | en_US |
| dc.subject | binary trees | en_US |
| dc.subject | meshes | en_US |
| dc.subject | incrementally extensible hypercubes | en_US |
| dc.subject | interconnection networks | en_US |
| dc.title | Graph embedding aspect of IEH graphs | en_US |
| dc.type | Article | en_US |