{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T13:20:19Z","timestamp":1748352019395},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","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":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0304-3975(03)00052-5","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"491-498","source":"Crossref","is-referenced-by-count":10,"title":["On the bandwidth of a Hamming graph"],"prefix":"10.1016","volume":"301","author":[{"given":"L.H.","family":"Harper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00052-5_BIB1","doi-asserted-by":"crossref","first-page":"2656","DOI":"10.1109\/TIT.2002.802643","article-title":"Index assignment for multichannel communication under failure","volume":"48","author":"Berger-Wolf","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(03)00052-5_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices\u2014a survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(03)00052-5_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimetric problems on graphs","volume":"1","author":"Harper","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(03)00052-5_BIB4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0166-218X(99)00082-7","article-title":"On an isoperimetric problem for Hamming graphs","volume":"95","author":"Harper","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(03)00052-5_BIB5","unstructured":"L.H. Harper, Global Methods for Combinatorial Isoperimetric Problems, Cambridge Univ. Press, Cambridge, to appear."},{"key":"10.1016\/S0304-3975(03)00052-5_BIB6","first-page":"113","article-title":"On the bandwidth of graph products","volume":"28","author":"Henrich","year":"1992","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/S0304-3975(03)00052-5_BIB7","unstructured":"H.S. Moghadam, Compression operators and a solution to the bandwidth problem of the product of n paths, Ph.D. Thesis, University of California, Riverside, 1983."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000525?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000525?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:29:26Z","timestamp":1553905766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503000525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0304397503000525"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00052-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}