{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:24Z","timestamp":1725664584037},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616269"},{"type":"electronic","value":"9783540706335"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/3-540-61626-8_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:05:25Z","timestamp":1330275925000},"page":"243-246","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bandwidth and cutwidth of the mesh of d-ary trees"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"31_CR1","unstructured":"D. Barth, R\u00e9seaux d'interconnexion: structures et communications, Thesis, Universit\u00e9 Bordeaux I, 1994."},{"issue":"n.6","key":"31_CR2","first-page":"487","volume":"29","author":"D. Barth","year":"1995","unstructured":"D. Barth, F. Pellegrini, J. Roman, A. Raspaud, On bandwidth, cutwidth and quotient graphs, LaBRI intern report, RAIRO Theor. Comp. Science, vol. 29, n. 6, pp. 487\u2013508, 1995.","journal-title":"RAIRO Theor. Comp. Science"},{"key":"31_CR3","unstructured":"C. Berge, Graphes et Hypergraphes, North Holland Publishing, 1971."},{"key":"31_CR4","unstructured":"M.M. Eshaghian, V.K. Prasanna Kumar, Parallel Geometric Algorithms for Digitized Pictures on Mesh of Trees, Proc. of IEEE FOCS, pp 270\u2013273, 1986."},{"key":"31_CR5","volume-title":"Some NP-complete problems on graphs","author":"F. Gavril","year":"1979","unstructured":"F. Gavril, Some NP-complete problems on graphs, Proc. 11th Conf. on Inf. sciences and systems, W.H Freeman pub., San Francisco, 1979."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"F.T. Leighton, Introduction to Parallel Algorithms and Architecture: arrays, trees, hypercubes, Morgan Kaufman Publisher, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing, vol. 16, pp. 263\u2013270, 1976.","journal-title":"Computing"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"C.D. Thompson, Area-time complexity for VLSI, Proc. 11th STOCS, ACM, pp. 81\u201388, 1979.","DOI":"10.1145\/800135.804401"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'96 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61626-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:24:08Z","timestamp":1587327848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61626-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616269","9783540706335"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-61626-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"8 June 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"}]}}