{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:14:51Z","timestamp":1741151691321,"version":"3.38.0"},"reference-count":6,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2001,2]]},"abstract":"<jats:p> The incrementally extensible hypercube (IEH) graph is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. In this paper, the authors present an efficient model to fulfill the embedding of a full binary tree into a full IEH graph. As the model the authors proposed, an algorithm is developed for the embedding with expansion 1, load 1, congestion 2, and dilation 2. Moreover, the embedding algorithm can be also applied into hypercubes with one faulty node. <\/jats:p>","DOI":"10.1177\/109434200101500105","type":"journal-article","created":{"date-parts":[[2005,3,8]],"date-time":"2005-03-08T19:22:51Z","timestamp":1110309771000},"page":"47-55","source":"Crossref","is-referenced-by-count":1,"title":["Reconfiguration of Complete Binary Trees in Full IEH Graphs and Faulty Hypercubes"],"prefix":"10.1177","volume":"15","author":[{"given":"Jen-Chih","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Information Management, Jin-Wen Institute of Technology,\r                        Hsinten, Taipei, Taiwan, R.O.C."}]},{"given":"Huan-Chao","family":"Keh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, Tamkang\r                        University, Tamsui, Taipei, Taiwan, R.O.C."}]}],"member":"179","published-online":{"date-parts":[[2001,2,1]]},"reference":[{"first-page":"137","volume-title":"Proc. Intl. Conf. Parallel Processing","author":"Chaudhary, V.","key":"atypb1"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(87)90002-5"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178908"},{"first-page":"90","volume-title":"IEEE International Conference on Computers and Communications (IPCCC-94)","author":"Sur, S.","key":"atypb4"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/71.655243"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1023"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434200101500105","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/109434200101500105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T04:58:54Z","timestamp":1741064334000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/109434200101500105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["10.1177\/109434200101500105"],"URL":"https:\/\/doi.org\/10.1177\/109434200101500105","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"type":"print","value":"1094-3420"},{"type":"electronic","value":"1741-2846"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}