{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T06:39:50Z","timestamp":1765607990407},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0890-5401(90)90027-f","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"87-106","source":"Crossref","is-referenced-by-count":12,"title":["The complexity of finding uniform emulations on paths and ring networks"],"prefix":"10.1016","volume":"86","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90027-F_BIB1","series-title":"Proceedings, Conference on Information Sciences and Systems","first-page":"675","article-title":"Parallel processing with limited resources","author":"Berman","year":"1983"},{"key":"10.1016\/0890-5401(90)90027-F_BIB2","article-title":"Distributed Computing: Structure and Complexity","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0890-5401(90)90027-F_BIB3","first-page":"137","article-title":"The complexity of finding uniform emulations on fixed graphs","volume":"29","author":"Bodlaender","year":"1988"},{"issue":"1986","key":"10.1016\/0890-5401(90)90027-F_BIB4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0019-9958(86)80008-0","article-title":"Simulations of large networks on smaller networks","volume":"71","author":"Bodlaender","year":"1986","journal-title":"Inform. Contr."},{"key":"10.1016\/0890-5401(90)90027-F_BIB5","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/TC.1982.1675994","article-title":"Quotient networks","volume":"C-31","author":"Fishburn","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0890-5401(90)90027-F_BIB6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0890-5401(90)90027-F_BIB7","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(90)90027-F_BIB8","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","article-title":"Improved dynamic programming algorithms for bandwidth minimization and the MinCut linear arrangement problem","volume":"5","author":"Gurari","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(90)90027-F_BIB9","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1137\/0213040","article-title":"On some variants of the bandwidth minimization problem","volume":"13","author":"Leung","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90027-F_BIB10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0601042","article-title":"Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time","volume":"1","author":"Saxe","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090027F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090027F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:57Z","timestamp":1548879957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090027F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["089054019090027F"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90027-f","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}