{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:36Z","timestamp":1725558996584},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_40","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:29:15Z","timestamp":1279088955000},"page":"370-380","source":"Crossref","is-referenced-by-count":0,"title":["Graph Bandwidth of Weighted Caterpillars"],"prefix":"10.1007","author":[{"given":"Zhiyong","family":"Lin","sequence":"first","affiliation":[]},{"given":"Mingen","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P. Chinn","year":"1982","unstructured":"Chinn, P., Chvatalova, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graph and matrics - a survey. Journal of Graph Theory\u00a06, 223\u2013254 (1982)","journal-title":"Journal of Graph Theory"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. Diaz","year":"2002","unstructured":"Diaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Computing Surveys\u00a034, 313\u2013356 (2002)","journal-title":"ACM Computing Surveys"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.: The np-completeness of the bandwidth minimization problem. Computing, 263\u2013270 (1976)","DOI":"10.1007\/BF02280884"},{"key":"40_CR4","doi-asserted-by":"publisher","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.: Complexity results for bandwidth minimization. SIAM Journal on Applied Mathematics\u00a034, 477\u2013495 (1978)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B. Monien","year":"1986","unstructured":"Monien, B.: The bandwidth minimization problem for caterpillars with hair length 3 is np-complete. SIAM Journal on Algebraic and Discrete Methods\u00a07, 505\u2013512 (1986)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0602041","volume":"2","author":"S.F. Assmann","year":"1981","unstructured":"Assmann, S.F., Peck, G.W., Syslo, M.M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM Journal on Algebraic and Discrete Methods\u00a02, 387\u2013393 (1981)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/S0895480192232333","volume":"7","author":"A.P. Sprague","year":"1994","unstructured":"Sprague, A.P.: An o(n logn) algorithm for bandwidth of interval graphs. SIAM Journal on Discrete Mathematics\u00a07, 213\u2013220 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"40_CR8","unstructured":"Glache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical report, TR98-014, Electronic Cooloquium on Computational Complexity (1998)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Unger, W.: The complexity of the approximation of the bandwidth problem. In: 37th Annual Symposium on Foundations of Computer Science, pp. 82\u201391 (1998)","DOI":"10.1109\/SFCS.1998.743431"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/jcss.1999.1682","volume":"60","author":"U. Feige","year":"2000","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. Journal of Computer System Science\u00a060, 510\u2013539 (2000)","journal-title":"Journal of Computer System Science"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jagm.2000.1118","volume":"40","author":"A. Gupta","year":"2001","unstructured":"Gupta, A.: Improved bandwidth approximation for trees and chordal graphs. Journal of Algorithms\u00a040, 24\u201336 (2001)","journal-title":"Journal of Algorithms"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Haralambides, J., Makedon, F., Monien, B.: Bandwidth minimization: an approximation algorithm for caterpillars. Mathematical Systems Theory (1991)","DOI":"10.1007\/BF02090396"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Cuthill, E.H., Mckee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of 24th ACM National Conference, pp. 157\u2013172 (1969)","DOI":"10.1145\/800195.805928"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:39:58Z","timestamp":1619491198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11496199_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}