{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T17:10:40Z","timestamp":1740244240927,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_42","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"414-424","source":"Crossref","is-referenced-by-count":1,"title":["Layout Volumes of the Hypercube"],"prefix":"10.1007","author":[{"given":"Lubomir","family":"Torok","sequence":"first","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","first-page":"465","volume":"27","author":"A. Bel Hala","year":"1993","unstructured":"Bel Hala, A.: Congestion optimale du plongement de l\u2019hypercube H(n) dans la chaine P(2n). ITA\u00a027, 465\u2013481 (1993)","journal-title":"ITA"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"S. Bezrukov","year":"2000","unstructured":"Bezrukov, S., Chavez, J.D., Harper, L.H., R\u00f6ttger, M., Schroeder, U.-P.: The congestion of n-cube layout on a rectangular grid. Discrete Mathematics\u00a0213, 13\u201319 (2000)","journal-title":"Discrete Mathematics"},{"key":"42_CR3","volume-title":"Proc. VLSI: Algorithms and Architectures","author":"G. Brebner","year":"1985","unstructured":"Brebner, G.: Relating routing graphs and two-dimensional grids. In: Proc. VLSI: Algorithms and Architectures. North Holland, Amsterdam (1985)"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-44541-2_27","volume-title":"Graph Drawing","author":"T. Biedl","year":"2001","unstructured":"Biedl, T., Thiele, T., Wood, D.R.: Three-dimensional orthogonal graph drawing with optimal volume. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 284\u2013295. Springer, Heidelberg (2001)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-24595-7_23","volume-title":"Graph Drawing","author":"T. Calamoneri","year":"2004","unstructured":"Calamoneri, T., Massini, A.: Nearly optimal three-dimensional layout of hypercube networks. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 247\u2013258. Springer, Heidelberg (2004)"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(99)00287-X","volume":"255","author":"T. Calamoneri","year":"2001","unstructured":"Calamoneri, T., Massini, A.: Optimal three-dimensional layout of interconnection networks. Theoretical Computer Science\u00a0255, 263\u2013279 (2001)","journal-title":"Theoretical Computer Science"},{"key":"42_CR7","unstructured":"Yeh, C.-H., Varvarigos, E.A., Parhami, B.: Multilayer VLSI layout for interconnection networks. In: Proc. Intl. Conf. on Parallel Processing, pp. 21\u201324 (2000)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Yeh, C.-H., Varvarigos, E.A., Parhami, B.: Efficient VLSI Layouts of hypercubic networks. In: Proc. Frontiers of Massivelly Parallel Computation, pp. 98\u2013105 (1999)","DOI":"10.1109\/FMPC.1999.750589"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-62495-3_44","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Symvonis, A., Whitesides, S.: Two algorithms for three-dimensional graph drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 139\u2013154. Springer, Heidelberg (1997)"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1142\/S0219265903000945","volume":"4","author":"S. Even","year":"2003","unstructured":"Even, S., Kupershtok, R.: Layout area of the hypercube. Journal of Interconnection Networks\u00a04, 395\u2013417 (2003)","journal-title":"Journal of Interconnection Networks"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0020-0190(02)00218-1","volume":"41","author":"R.I. Greenberg","year":"2002","unstructured":"Greenberg, R.I., Lee, G.: On the area of hypercube networks. Information Processing Letters\u00a041, 41\u201346 (2002)","journal-title":"Information Processing Letters"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/0215057","volume":"15","author":"F.T. Leighton","year":"1986","unstructured":"Leighton, F.T., Rosenberg, A.L.: Three-dimensional circuit layouts. SIAM Journal on Computing\u00a015, 793\u2013813 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR13","first-page":"270","volume-title":"Proc. 21st Annual IEEE Symposium on Foundation of Computer Science","author":"C.E. Leiserson","year":"1980","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proc. 21st Annual IEEE Symposium on Foundation of Computer Science, pp. 270\u2013281. IEEE Computer Science Press, Los Alamitos (1980)"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/12.833112","volume":"49","author":"A. Patel","year":"2000","unstructured":"Patel, A., Kusalik, A., McCroskey, C.: Area-efficient layouts for binary hypercubes. IEEE Transactions on Computers\u00a049, 160\u2013169 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01744565","volume":"16","author":"F.P. Preparata","year":"1983","unstructured":"Preparata, F.P.: Optimal three-dimensional VLSI layouts. Mathematical Systems Theory\u00a016, 1\u20138 (1983)","journal-title":"Mathematical Systems Theory"},{"key":"42_CR16","first-page":"509","volume":"26","author":"A. Raspaud","year":"1995","unstructured":"Raspaud, A., S\u00fdkora, O., Vrt\u2019o, I.: Cutwidth of the de Bruijn graph. RAIRO\u00a026, 509\u2013514 (1995)","journal-title":"RAIRO"},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/2402.322384","volume":"30","author":"A.L. Rosenberg","year":"1983","unstructured":"Rosenberg, A.L.: Three-dimensional VLSI: A case study. Journal of the ACM\u00a030, 397\u2013416 (1983)","journal-title":"Journal of the ACM"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Thompson, C.D.: Area-time complexity for VLSI. In: Proc. 11th Annual ACM Symposium on Theory of Computing, pp. 81\u201388 (1979)","DOI":"10.1145\/800135.804401"},{"key":"42_CR19","volume-title":"Computational Aspects of VLSI","author":"J.D. Ullman","year":"1983","unstructured":"Ullman, J.D.: Computational Aspects of VLSI. Comp. Sci. Press, Rockville (1983)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T16:43:51Z","timestamp":1740242631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}