{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:57Z","timestamp":1725456477270},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0002739","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"242-245","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cutwidth of the mesh of d-ary trees"],"prefix":"10.1007","author":[{"given":"Imrich","family":"Vrt'o","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"27_CR1","unstructured":"Barth, D., R\u00e9seaux d'interconnexion: structures et communications, PhD. Thesis, LABRI, Universit\u00e9 Bordeaux I, 1994."},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-61626-8_31","volume-title":"Proc. 2nd Intl. Euro-Par Conference","author":"D. Barth","year":"1996","unstructured":"Barth, D., Bandwidth and cutwidth of the mesh of d-ary trees, in: Proc. 2nd Intl. Euro-Par Conference, Lecture Notes in Computer Science 1123, Springer Verlag, Berlin, 1996, 243\u2013246."},{"key":"27_CR3","first-page":"270","volume-title":"Proc. 27th Annual IEEE Symposium on Foundation of Computer Science","author":"M.M. Eshagian","year":"1986","unstructured":"Eshagian, M.M., Prasanna, V.K., Parallel geometric algorithms for digital pictures on mesh of trees, in: Proc. 27th Annual IEEE Symposium on Foundation of Computer Science, IEEE Computer Society Press, Los Alamitos, 1986, 270\u2013273."},{"key":"27_CR4","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes, Morgan Kaufmann Publishers, San Mateo, 1992."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0603010","volume":"3","author":"T. Lengauer","year":"1982","unstructured":"Lengauer, T., Upper and lower bounds for the min-cut linear arrangenents problem on trees, SIAM J. Algebraic and Discrete Methods\n3 (1982), 99\u2013113.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"1671","DOI":"10.1109\/T-ED.1980.20086","volume":"27","author":"A.D. Lopez","year":"1980","unstructured":"Lopez, A.D., Law, H.F.S., A dense gate matrix layout method for MOS VLSI, IEEE Transactions on Electronic Devices\n27 (1980), 1671\u20131675.","journal-title":"IEEE Transactions on Electronic Devices"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-57899-4_66","volume-title":"Proc. 19th Intl. Workshop on Graph-Theoretic Concepts in Computer Science","author":"K. Nakano","year":"1994","unstructured":"Nakano, K., Linear layout of generalized hypercubes, in: Proc. 19th Intl. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790, Springer Verlag, Berlin, 1994, 364\u2013375."},{"key":"27_CR8","first-page":"509","volume":"26","author":"A. Raspaud","year":"1996","unstructured":"Raspaud, A., S\u00fdkora, 0., Vrt'o, I., Cutwidth of the de Bruiju graph, RAIRO-Theoretical Informatics and Applications\n26 (1996), 509\u2013514.","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1145\/4221.4228","volume":"32","author":"M. Yannakakis","year":"1985","unstructured":"Yannakakis, M., A polynomial algorithm for the Min cut linear arrangement of trees, J. ACM\n32 (1985), 950\u2013988.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:49:23Z","timestamp":1587343763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0002739","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}