{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:54:31Z","timestamp":1732031671574},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:p>We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size n into a hypercube with expansion ratio of [Formula: see text] when n is a power of two. When n is not a power of two, the expansion is [Formula: see text], which we conjecture to be near optimal. For a honeycomb mesh, the dilation of the embedding is 1. For a honeycomb torus, the dilation can be as large as 2\u2308 log n\u2309+3, because of the extra links connecting symmetric opposite nodes of degree two. A honeycomb network, built recursively using hexagon tessellation, is a multiprocessor interconnection network, and also a Cayley graph, and it is better than the planar mesh with the same number of nodes in terms of degree, diameter, number of links, and bisection width.<\/jats:p>","DOI":"10.1142\/s0129626404001957","type":"journal-article","created":{"date-parts":[[2005,5,24]],"date-time":"2005-05-24T11:56:24Z","timestamp":1116935784000},"page":"367-375","source":"Crossref","is-referenced-by-count":7,"title":["OPTIMAL EMBEDDING OF HONEYCOMB NETWORKS INTO HYPERCUBES"],"prefix":"10.1142","volume":"14","author":[{"given":"DOINA","family":"BEIN","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Nevada, Las Vegas, NV 89154, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"WOLFGANG W.","family":"BEIN","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nevada, Las Vegas, NV 89154, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"NATASA","family":"BRAJKOVSKA","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nevada, Los Vegas, NV 89154, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHAHRAM","family":"LATIFI","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, University of Nevada, Las Vegas, NV 89154, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/71.629486"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0097-8493(84)90038-4"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/T-VT.1982.23925"},{"key":"rf6","volume-title":"Mobile and wireless networks","author":"Black U.","year":"1996"},{"key":"rf7","volume-title":"Wireless and personal communication systems","author":"Garg V. K.","year":"1996"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(89)90044-9"},{"key":"rf9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1021\/ci00024a002","volume":"35","author":"Tosic R.","journal-title":"Journal Of Chemical Information and Computer Sciences"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00141-6"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000505"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/71.899940"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626404001957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,11]],"date-time":"2021-07-11T04:01:46Z","timestamp":1625976106000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":10,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1142\/S0129626404001957"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001957","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}