1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, HYen_US
dc.contributor.authorChen, RJen_US
dc.date.accessioned2014-12-08T15:44:28Z-
dc.date.available2014-12-08T15:44:28Z-
dc.date.issued2001-01-01en_US
dc.identifier.issn1016-2364en_US
dc.identifier.urihttp://hdl.handle.net/11536/30035-
dc.description.abstractIn 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.language.isoen_USen_US
dc.subjecthypercubesen_US
dc.subjectembeddingen_US
dc.subjectbinary treesen_US
dc.subjectmeshesen_US
dc.subjectincrementally extensible hypercubesen_US
dc.subjectinterconnection networksen_US
dc.titleGraph embedding aspect of IEH graphsen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGen_US
dc.citation.volume17en_US
dc.citation.issue1en_US
dc.citation.spage23en_US
dc.citation.epage33en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000167680200002-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000167680200002.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...