{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:48:38Z","timestamp":1773514118917,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council","doi-asserted-by":"publisher","award":["NSC 89-2211-E-009-075"],"award-info":[{"award-number":["NSC 89-2211-E-009-075"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00507-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:36:00Z","timestamp":1051115760000},"page":"185-190","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":29,"title":["Generalized honeycomb torus"],"prefix":"10.1016","volume":"86","author":[{"given":"Hsun-Jung","family":"Cho","sequence":"first","affiliation":[]},{"given":"Li-Yen","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00507-0_BIB001","series-title":"Graph Theory with Applications","author":"Bondy","year":"1980"},{"key":"10.1016\/S0020-0190(02)00507-0_BIB002","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1142\/S0129626499000505","article-title":"All-to-all broadcasting algorithms on honeycomb networks and applications","volume":"9","author":"Carle","year":"1999","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0190(02)00507-0_BIB003","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/12.46277","article-title":"Addressing, routing, and broadcasting in hexagonal mesh multiprocessors","volume":"39","author":"Chen","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00507-0_BIB004","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0190(02)00507-0_BIB005","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0020-0190(99)00141-6","article-title":"Honeycomb tori are Hamiltonian","volume":"72","author":"Megson","year":"1999","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00507-0_BIB006","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1142\/S0129626499000517","article-title":"Fault-tolerant ring embedding in a honeycomb torus with nodes failures","volume":"9","author":"Megson","year":"1999","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0190(02)00507-0_BIB007","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/71.899940","article-title":"A unified formulation of honeycomb and diamond networks","volume":"12","author":"Parhami","year":"2001","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0020-0190(02)00507-0_BIB008","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1109\/71.629486","article-title":"Honeycomb networks: Topological properties and communication Algorithms","volume":"8","author":"Stojmenovic","year":"1997","journal-title":"IEEE Trans. Parallel Distributed Systems"},{"key":"10.1016\/S0020-0190(02)00507-0_BIB009","first-page":"166","article-title":"An efficient dictionary machine using hexagonal processor arrays","volume":"7","author":"Youn","year":"1996","journal-title":"IEEE Trans. Parallel Distributed Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005070?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002005070?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T10:17:18Z","timestamp":1762165038000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002005070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002005070"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00507-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized honeycomb torus","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(02)00507-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}