{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:57:46Z","timestamp":1774799866522,"version":"3.50.1"},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,1,1]]},"DOI":"10.1587\/transfun.2021eap1144","type":"journal-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T22:12:20Z","timestamp":1659651140000},"page":"35-44","source":"Crossref","is-referenced-by-count":1,"title":["On the Crossing Number of a Torus Network"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Antoine","family":"BOSSARD","sequence":"first","affiliation":[{"name":"Graduate School of Science, Kanagawa University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiichi","family":"KANEKO","sequence":"additional","affiliation":[{"name":"Graduate School of Engineering, Tokyo University of Agriculture and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederick C.","family":"HARRIS, JR.","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Nevada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] F.T. Leighton, Complexity issues in VLSI, MIT Press, Cambridge, MA, USA, 1983."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] F.T. Leighton, \u201cNew lower bound techniques for VLSI,\u201d Math. Systems Theory, vol.17, no.1, pp.47-70, 1984. 10.1007\/bf01744433","DOI":"10.1007\/BF01744433"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] O. S\u00fdkora and I. Vrto, \u201cOn VLSI layouts of the star graph and related networks,\u201d Integration, vol.17, no.1, pp.83-93, 1994. 10.1016\/0167-9260(94)90021-3","DOI":"10.1016\/0167-9260(94)90021-3"},{"key":"4","unstructured":"[4] I.G. Tollis, G.D. Battista, P. Eades, and R. Tamassia, Graph Drawing: Algorithms for Visualizations of Graphs, Prentice Hall, New York, NY, USA, 1999."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M.R. Garey and D.S. Johnson, \u201cCrossing number is NP-complete,\u201d SIAM J. Algebraic Discrete Methods, vol.4, no.3, pp.312-316, 1983. 10.1137\/0604033","DOI":"10.1137\/0604033"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] P. Erd\u0151s and R.K. Guy, \u201cCrossing number problems,\u201d American Mathematical Monthly, vol.80, no.1, pp.52-58, 1973. 10.1080\/00029890.1973.11993230","DOI":"10.1080\/00029890.1973.11993230"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] P. Tur\u00e1n, \u201cA note of welcome,\u201d J. Graph Theory, vol.1, no.1, pp.7-9, 1977. 10.1002\/jgt.3190010105","DOI":"10.1002\/jgt.3190010105"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] J. Pach, J. Spencer, and G. T\u00f3th, \u201cNew bounds on crossing numbers,\u201d Discrete Comput. Geom., vol.24, no.4, pp.623-644, 2000. 10.1007\/s4540010011","DOI":"10.1007\/s4540010011"},{"key":"9","unstructured":"[9] O. S\u00fdkora and I. Vrto, \u201cOn crossing numbers of hypercubes and cube connected cycles,\u201d Technical Report, MPI-I-91-124, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1991."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] L. Faria, C.M.H. de Figueiredo, O. S\u00fdkora, and I. Vrto, \u201cAn improved upper bound on the crossing number of the hypercube,\u201d J. Graph Theory, vol.59, no.2, pp.145-161, 2008. 10.1002\/jgt.20330","DOI":"10.1002\/jgt.20330"},{"key":"11","unstructured":"[11] J.R. Fredrickson, \u201cOn the crossing number of complete graphs: growing minimal <i>K<sub>n<\/sub><\/i> from minimal <i>K<\/i><sub><i>n<\/i>-1<\/sub>,\u201d Ph.D. thesis, University of Nevada Reno, 2006."},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] M. Kle\u0161\u010d and \u0160. Schr\u00f6tter, \u201cOn the crossing numbers of Cartesian products of stars and graphs of order six,\u201d Discussiones Mathematicae Graph Theory, vol.33, no.3, pp.583-597, 2013. 10.7151\/dmgt.1705","DOI":"10.7151\/dmgt.1705"},{"key":"13","unstructured":"[13] A. Bossard, K. Kaneko, and F.C. Harris, \u201cOn the crossing number of tori,\u201d Proc. Fourth Conference on Electronics and Software Science (ICESS), pp.55-64, 2018. Takamatsu, Japan."},{"key":"14","unstructured":"[14] J. Duato, S. Yalamanchili, and L. Ni, Interconnection Networks-An Engineering Approach, Morgan Kaufmann, San Francisco, CA, USA, 2003. Revised printing. 10.1016\/B978-1-55860-852-8.X5000-7"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] G. Chartrand, L. Lesniak, and P. Zhang, Graphs &amp; Digraphs, 6 ed., Chapman and Hall\/CRC, Boca Raton, FL, USA, 2015. 10.1201\/b19731","DOI":"10.1201\/b19731"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J. Pach and G. T\u00f3th, \u201cCrossing number of toroidal graphs,\u201d Topics in Discrete Mathematics, pp.581-590, 2006. 10.1007\/3-540-33700-8_28","DOI":"10.1007\/3-540-33700-8_28"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] P. Hlin\u011bn\u00fd and G. Salazar, \u201cApproximating the crossing number of toroidal graphs,\u201d Proc. 18th International Symposium on Algorithms and Computation (ISAAC), Sendai, Japan, pp.148-159, Dec. 2007. 10.1007\/978-3-540-77120-3_15","DOI":"10.1007\/978-3-540-77120-3_15"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] M. Kle\u015d\u0109, R.B. Richter, and I. Stobert, \u201cThe crossing number of <i>C<\/i><sub>5<\/sub>\u00d7<i>C<sub>n<\/sub><\/i>,\u201d J. Graph Theory, vol.22, no.3, pp.239-243, 1996. 10.1002\/(sici)1097-0118(199607)22:3%3C239::aid-jgt4%3E3.0.co;2-n","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<239::AID-JGT4>3.0.CO;2-N"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] G. Salazar and E. Ugalde, \u201cAn improved bound for the crossing number of <i>C<sub>m<\/sub><\/i>\u00d7<i>C<sub>n<\/sub><\/i>: A self-contained proof using mostly combinatorial arguments,\u201d Graphs and Combinatorics, vol.20, pp.247-253, June 2004. 10.1007\/s00373-003-0549-5","DOI":"10.1007\/s00373-003-0549-5"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/1\/E106.A_2021EAP1144\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T03:14:28Z","timestamp":1673061268000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/1\/E106.A_2021EAP1144\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021eap1144","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,1]]},"article-number":"2021EAP1144"}}