{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:35Z","timestamp":1725664055642},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:41:12Z","timestamp":1330245672000},"page":"364-375","source":"Crossref","is-referenced-by-count":10,"title":["Linear layouts of generalized hypercubes"],"prefix":"10.1007","author":[{"given":"Koji","family":"Nakano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"L. N. Bhuyan and D. P. Agrawal. Generalized hypercube and hyperbus structures for a computer network. IEEE Transactions on Computers, C-33(4), April 1984.","DOI":"10.1109\/TC.1984.1676437"},{"key":"31_CR2","first-page":"221","volume-title":"VLSI: Algorithms and Architectures","author":"G. Brebner","year":"1985","unstructured":"G. Brebner. Relating routing and two-dimensinal grids. In P. Bertolazii and F. Luccio, editors, VLSI: Algorithms and Architectures, pages 221\u2013231. Elsevier Science Publishers B.V.(North-Holland), 1985."},{"issue":"3","key":"31_CR3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/359361.359447","volume":"21","author":"R. A. DeMillo","year":"1978","unstructured":"R. A. DeMillo, S. C. Eisenstat, and R. J. Lipton. Preserving average proximity in arrays. Communications of the ACM, 21(3):228\u2013231, March 1978.","journal-title":"Communications of the ACM"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified polynomial complete problems. SIGACT, pages 47\u201363, 1974.","DOI":"10.1145\/800119.803884"},{"issue":"1","key":"31_CR5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L. H. Harper","year":"1964","unstructured":"L. H. Harper. Optimal assignments of numbers to vertices. J. Soc. Indust. Appl. Math, 12(1):131\u2013135, March 1964.","journal-title":"J. Soc. Indust. Appl. Math"},{"key":"31_CR6","unstructured":"F. T. Leighton. Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks. MIT Press, 1983."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes. Morgan Kaufmann, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","volume":"23","author":"F. Makedon","year":"1989","unstructured":"F. Makedon and I. H. Subdorough. On minimizing width in linear layouts. Discrete Applied Mathematics, 23:243\u2013265, 1989.","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"31_CR9","first-page":"647","volume":"J76-D","author":"Y. Manabe","year":"1984","unstructured":"Y. Manabe, K. Hagihara, and N. Tokura. The minimum bisection widths of the cube-connected-cycles graph and cube graph. Trans. IEICE(D) Japan, J76-D(6):647\u2013654, June 1984. in Japanese.","journal-title":"Trans. IEICE(D) Japan"},{"issue":"4","key":"31_CR10","first-page":"856","volume":"J73-A","author":"K. Nakano","year":"1990","unstructured":"K. Nakano, W. Chen, T. Masuzawa, K. Hagihara, and N. Tokura. Cut width and bisection width of hypercube graph. IEICE Transactions, J73-A(4):856\u2013862, April 1990. in Japanese.","journal-title":"IEICE Transactions"},{"issue":"106","key":"31_CR11","doi-asserted-by":"crossref","first-page":"475","DOI":"10.21136\/CMJ.1981.101762","volume":"31","author":"L. Niepel","year":"1981","unstructured":"L. Niepel and P. Tomasta. Elevation of a graph. Czechoslovak Mathematical Journal, 31(106):475\u2013483, 1981.","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"4","key":"31_CR12","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/0204038","volume":"4","author":"A. L. Rosenberg","year":"1975","unstructured":"A. L. Rosenberg. Preserving proximity in arrays. SIAM J. Comput., 4(4):443\u2013460, December 1975.","journal-title":"SIAM J. Comput."},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"C. D. Thompson. Area-time complexity for VLSI. In Proc. of 11th Symposium on Theory of Computing, pages 81\u201388. ACM, 1979.","DOI":"10.1145\/800135.804401"},{"key":"31_CR14","unstructured":"K. Wada and K. Kawaguchi. Optimal bounds of the crossing number and the bisection width for generalized hypercube graphs. In Proc. of 16th Biennial Symposium on Communications, pages 323\u2013326, May 1992."},{"key":"31_CR15","unstructured":"K. Wada, H. Suzuki, and K. Kawaguchi. The crossing number of hypercube graphs. In Proc. of 43rd Convention of IPS Japan, pages 1\u201395, 1991. in Japanese."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:52:50Z","timestamp":1640911970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}