{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:24:38Z","timestamp":1726406678475},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:48:02Z","timestamp":1330249682000},"page":"214-218","source":"Crossref","is-referenced-by-count":4,"title":["On the crossing number of the hypercube and the cube connected cycles"],"prefix":"10.1007","author":[{"given":"Ondrej","family":"S\u00fdkora","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imrich","family":"Vr\u0165o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"21_CR1","unstructured":"Brebner, G., Relating routing graphs and two dimensional array grids, In:Proceedings VLSI: Algorithms and Architectures, North Holland, 1985."},{"key":"21_CR2","first-page":"757","volume":"17","author":"R. B. Eggleton","year":"1970","unstructured":"Eggleton, R. B., Guy, R. P., The crossing number of the n-cube, Notices of the American Mathematical Society, 17, 1970, 757.","journal-title":"Notices of the American Mathematical Society"},{"issue":"1","key":"21_CR3","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1080\/00029890.1973.11993230","volume":"80","author":"P. Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P., Guy, R.P., Crossing number problems, AmericanMathematical Monthly, 80, 1, 1973, 52\u201358.","journal-title":"AmericanMathematical Monthly"},{"issue":"4","key":"21_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","volume":"15","author":"F. Harary","year":"1988","unstructured":"Harary, F., Hayes, J. P., Horng-Jyh Wu, A survey of the theory of hypercube graphs, Computers and Mathematics with Applications, 15, 4, 1988, 277\u2013289.","journal-title":"Computers and Mathematics with Applications"},{"key":"21_CR5","unstructured":"Heath, M. I. (editor), Hypercube Multicomputers, Proceedings of the 2-nd Conference on Hypercube Multicomputers, SIAM, 1987."},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0021-9800(70)80087-4","volume":"9","author":"D. J. Kleitman","year":"1971","unstructured":"Kleitman, D. J., The crossing number of K 5,n , Journal of Combinatorial Theory, 9, 1971, 315\u2013323.","journal-title":"Journal of Combinatorial Theory"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Leighton, F. T., New lower bound techniques for VLSI, In: Proceedings of the 22-nd Annual Symposium on Foundations of Computer Science, 1981, 1\u201312.","DOI":"10.1109\/SFCS.1981.22"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Leiserson, C. E., Area efficient graph layouts (for VLSI), In: Proceedings of the 21-st Annual IEEE Symposium on Foundations of Computer Science, 1980, 270\u2013281.","DOI":"10.1109\/SFCS.1980.13"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0095-8956(72)90042-1","volume":"12","author":"P. C. Kainen","year":"1972","unstructured":"Kainen, P. C., A lower bound for crossing numbers of graphs with applications to K n ,K p,q , and Q(d), Journal of Combinatorial Theory (B), 12, 1972, 287\u2013298.","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Preparata, F. P., Vuillemin, J. E., The cube-connected cycles: a versatile network for parallel computation, In: Proceedings of the 20-th Annual IEEE Symposium on Foundations of Computer Science, 1979, 140\u2013147.","DOI":"10.1109\/SFCS.1979.43"}],"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-55121-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:39Z","timestamp":1605646659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}