{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:03:56Z","timestamp":1775066636991,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0167-8191(02)00135-7","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T12:54:12Z","timestamp":1034168052000},"page":"1293-1305","source":"Crossref","is-referenced-by-count":34,"title":["An efficient algorithm for constructing Hamiltonian paths in meshes"],"prefix":"10.1016","volume":"28","author":[{"given":"Shao","family":"Dong Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney","family":"Topor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0167-8191(02)00135-7_BIB1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1051\/ita\/1994280605671","article-title":"The hamilton circuit problem on grids","volume":"28","author":"Afrati","year":"1994","journal-title":"Theoretical Informatics and Applications"},{"key":"10.1016\/S0167-8191(02)00135-7_BIB2","doi-asserted-by":"crossref","unstructured":"S.D. Chen, H. Shen, R.W. Topor, Efficient parallel permutation-based range-join algorithms on mesh-connected computers, in: Proceedings of the 1995 Asian Computing Science Conference, Pathumthani, Thailand, Springer-Verlag, 1995, pp. 225\u2013238","DOI":"10.1007\/3-540-60688-2_47"},{"issue":"4","key":"10.1016\/S0167-8191(02)00135-7_BIB3","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/71.995821","article-title":"Permutation-based range-join algorithms on N-dimensional meshes","volume":"13","author":"Chen","year":"2002","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(02)00135-7_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-8191(02)00135-7_BIB5","unstructured":"Intel Corporation literature, Intel Corporation, 1991"},{"issue":"4","key":"10.1016\/S0167-8191(02)00135-7_BIB6","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0211056","article-title":"Hamilton paths in grid graphs","volume":"11","author":"Itai","year":"1982","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0167-8191(02)00135-7_BIB7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(92)90096-E","article-title":"Optimal total exchange for a 3-d torus of processors","volume":"42","author":"Plateau","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0167-8191(02)00135-7_BIB8","first-page":"947","article-title":"On the capacity of multihop slottee ALOHA networks with regular structure","volume":"COM-31","author":"Silvester","year":"1983","journal-title":"IEEE Transactions on Communications"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102001357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102001357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T03:25:35Z","timestamp":1554866735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102001357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":8,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0167819102001357"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00135-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}