{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T15:10:17Z","timestamp":1698333017300},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1007\/bf01788550","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T18:38:32Z","timestamp":1119206312000},"page":"279-284","source":"Crossref","is-referenced-by-count":5,"title":["On the problem of bandsize"],"prefix":"10.1007","volume":"3","author":[{"given":"Katherine","family":"Heinrich","sequence":"first","affiliation":[]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01788550_CR1","doi-asserted-by":"crossref","first-page":"728","DOI":"10.2514\/3.4575","volume":"6","author":"F.A. Akyuz","year":"1968","unstructured":"Akyuz, F.A., Utku, S.: An automatic node-relabelling scheme for bandwidth minimization of stiffness matrices. J. Am. Inst. Aeronautics and Astronautics6, 728\u2013730 (1968)","journal-title":"J. Am. Inst. Aeronautics and Astronautics"},{"key":"BF01788550_CR2","unstructured":"Chen, K.W., Irani, K.B.: Mapping problem and graph numbering. In: Proc. Workshop on Interconn. Networks for Parallel and Distr. Processing (H.J. Siegel ed.) pp. 41\u201346. IEEE 1980"},{"key":"BF01788550_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P.Z. Chinn","year":"1982","unstructured":"Chinn, P.Z., Chv\u00e1talov\u00e1, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices. J. Graph Theory6, 223\u2013254 (1982)","journal-title":"J. Graph Theory"},{"key":"BF01788550_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-1-4615-8675-3_14","volume-title":"Several strategies for reducing the bandwidth of matrices in sparse matrices and their applications","author":"E. Cuthill","year":"1972","unstructured":"Cuthill, E.: Several strategies for reducing the bandwidth of matrices in sparse matrices and their applications (D. Rose and R. Willoughby eds.) pp. 157\u2013166. New York: Plenum Press N.Y. 1972"},{"key":"BF01788550_CR5","first-page":"273","volume-title":"9th Southeastern Conference on Combinatorics, Graph Theory, and Computing","author":"A.K. Dewdney","year":"1976","unstructured":"Dewdney, A.K.: The bandwidth problem for graphs: some recent results. In: 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 273\u2013288. Winnipeg: Utilitas Math, 1976"},{"key":"BF01788550_CR6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","volume":"34","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization. SIAM J. Appl. Math.34, 477\u2013495 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"BF01788550_CR7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L.H. Harper","year":"1966","unstructured":"Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Comb. Theory1 385\u2013393 (1966)","journal-title":"J. Comb. Theory"},{"key":"BF01788550_CR8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0012-365X(81)90276-4","volume":"33","author":"J. Kahn","year":"1981","unstructured":"Kahn, J., Kleitman, D.J.: On cross-bandwidth. Discrete Math.33, 385\u2013393 (1981)","journal-title":"Discrete Math."},{"key":"BF01788550_CR9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J.B. Saxe","year":"1980","unstructured":"Saxe, J.B.: Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Algebraic and Discrete Methods1, 363\u2013369 (1980).","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"BF01788550_CR10","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1093\/comjnl\/10.3.300","volume":"10","author":"R.P. Tewarson","year":"1967","unstructured":"Tewarson, R.P.: Row column permutation of sparse matrices. Computer J.10, 300\u2013305 (1967)","journal-title":"Computer J."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788550.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788550\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T13:56:50Z","timestamp":1557410210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["BF01788550"],"URL":"https:\/\/doi.org\/10.1007\/bf01788550","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}