{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:20:31Z","timestamp":1742383231777},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0020-0190(01)00149-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"75-79","source":"Crossref","is-referenced-by-count":20,"title":["Algorithmic construction of Hamiltonians in pyramids"],"prefix":"10.1016","volume":"80","author":[{"given":"H.","family":"Sarbazi-Azad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ould-Khaoua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.M.","family":"Mackenzie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00149-1_BIB001","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0129626497000073","article-title":"On embedding cycles in k-ary n-cubes","volume":"7","author":"Ashir","year":"1997","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0020-0190(01)00149-1_BIB002","series-title":"Technical Report 1996\/30","article-title":"Fault tolerant embedding of Hamiltonian circuits in k-ary n-cubes","author":"Ashir","year":"1996"},{"key":"10.1016\/S0020-0190(01)00149-1_BIB003","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1109\/12.403718","article-title":"Lee distance and topological properties of k-ary n-cubes","volume":"44","author":"Bose","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(01)00149-1_BIB004","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1109\/12.743415","article-title":"Fault-tolerance properties of pyramid networks","volume":"48","author":"Cao","year":"1999","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(01)00149-1_BIB005","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/0404045","article-title":"On the existence of Hamiltonian circuits in faulty hypercubes","volume":"4","author":"Chan","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(01)00149-1_BIB006","series-title":"Proc. Internat. Symp. Parallel Processing","first-page":"112","article-title":"Optimum embedding of end-around meshes into pyramid networks","author":"Dingle","year":"1991"},{"key":"10.1016\/S0020-0190(01)00149-1_BIB007","series-title":"Proc. IEEE Symp. Parallel and Distributed Processing","first-page":"220","article-title":"Simulation of binary trees and x-trees on pyramid networks","author":"Dingle","year":"1992"},{"key":"10.1016\/S0020-0190(01)00149-1_BIB008","series-title":"Foundation of Computing","author":"Gruska","year":"1997"},{"key":"10.1016\/S0020-0190(01)00149-1_BIB009","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/S1383-7621(96)00120-8","article-title":"Embedding of rings in 2-D meshes and tori with faulty nodes","volume":"43","author":"Kim","year":"1997","journal-title":"J. Systems Architecture"},{"key":"10.1016\/S0020-0190(01)00149-1_BIB010","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0743-7315(90)90110-B","article-title":"Mapping pyramid algorithms into hypercubes","volume":"9","author":"Lai","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0020-0190(01)00149-1_BIB011","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0190(01)00149-1_BIB012","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1137\/0216004","article-title":"Data movement techniques for the pyramid computer","volume":"16","author":"Miller","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00149-1_BIB013","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/jpdc.1996.0097","article-title":"Embedding pyramids into 3D meshes","volume":"36","author":"Ng","year":"1996","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0020-0190(01)00149-1_BIB014","series-title":"Proc. Internat. Conf. Parallel Processing","first-page":"340","article-title":"Embedding Hamiltonians and hypercubes in the star interconnection graph","author":"Nigam","year":"1990"},{"key":"10.1016\/S0020-0190(01)00149-1_BIB015","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1002\/cpe.4330050603","article-title":"Pyramid mapping onto hypercubes for computer vision","author":"Ziavras","year":"1993","journal-title":"Concurrency: Practice & Experience"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T16:23:11Z","timestamp":1556209391000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0020019001001491"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00149-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}