{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:13:09Z","timestamp":1759133589660},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2018,12,1]]},"DOI":"10.1587\/transinf.2018pap0008","type":"journal-article","created":{"date-parts":[[2018,11,30]],"date-time":"2018-11-30T22:27:44Z","timestamp":1543616864000},"page":"2908-2915","source":"Crossref","is-referenced-by-count":2,"title":["Order Adjustment Approach Using Cayley Graphs for the Order\/Degree Problem"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Teruaki","family":"KITASUKA","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Hiroshima University"}]},{"given":"Takayuki","family":"MATSUZAKI","sequence":"additional","affiliation":[{"name":"Graduate School of Science and Technology, Kumamoto University"}]},{"given":"Masahiro","family":"IIDA","sequence":"additional","affiliation":[{"name":"Division of Computer Engineering, Faculty of Advanced Science and Technology, Kumamoto University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] M. Koibuchi, I. Fujiwara, F. Chaix, and H. Casanova, \u201cTowards ideal hop counts in interconnection networks with arbitrary size,\u201d Proc. 2016 Fourth International Symposium on Computing and Networking (CANDAR), pp.188-194, Nov. 2016. 10.1109\/candar.2016.0042","DOI":"10.1109\/CANDAR.2016.0042"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] R. Yasudo, M. Koibuchi, K. Nakano, H. Matsutani, and H. Amano, \u201cOrder\/radix problem: Towards low end-to-end latency interconnection networks,\u201d Proc. 46th International Conference on Parallel Processing (ICPP), pp.322-331, Aug. 2017. 10.1109\/icpp.2017.41","DOI":"10.1109\/ICPP.2017.41"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] N.T. Truong, I. Fujiwara, M. Koibuchi, and K.-V. Nguyen, \u201cDistributed shortcut networks: Low-latency low-degree non-random topologies targeting the diameter and cable length trade-off,\u201d IEEE Trans. Parallel Distrib. Syst., vol.28, no.4, pp.989-1001, April 2017. 10.1109\/tpds.2016.2613043","DOI":"10.1109\/TPDS.2016.2613043"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J. Kim, W.J. Dally, S. Scott, and D. Abts, \u201cTechnology-driven, highly-scalable dragonfly topology,\u201d Proc. 35th International Symposium on Computer Architecture (ISCA), pp.77-88, June 2008. 10.1109\/isca.2008.19","DOI":"10.1109\/ISCA.2008.19"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J.-Y. Shin, B. Wong, and E.G. Sirer, \u201cSmall-world datacenters,\u201d Proc. 2nd ACM Symposium on Cloud Computing (SOCC'11), Article 2, 13 pages, Oct. 2011. 10.1145\/2038916.2038918","DOI":"10.1145\/2038916.2038918"},{"key":"6","unstructured":"[6] \u201cGraph golf: The degree-order problem competition,\u201d [Online]. Available: http:\/\/research.nii.ac.jp\/graphgolf\/"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] V.G. Cerf, D.D. Cowan, R.C. Mullin, and R.G. Stanton, \u201cA lower bound on the average shortest path length in regular graphs,\u201d Networks, vol.4, no.4, pp.335-342, 1974. 10.1002\/net.3230040405","DOI":"10.1002\/net.3230040405"},{"key":"8","unstructured":"[8] I. Fujiwara, S. Fujita, K. Nakano, T. Inoue, and M. Koibuchi, \u201cLet's solve the order\/degree problem to make the lowest-latency interconnections,\u201d IEICE Tech. Rep., vol.115, no.174, CPSY2015-38, pp.223-228, Aug. 2015 (in Japanese)."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] H. Handa and R. Hasegawa, \u201cSolving order\/degree problems by using EDA-GK,\u201d Proc. Genetic and Evolutionary Computation Conference Companion (GECCO'17), pp.25-26, July 2017. 10.1145\/3067695.3082042","DOI":"10.1145\/3067695.3082042"},{"key":"10","unstructured":"[10] Combinatorics Wiki, \u201cThe degree diameter problem for general graphs,\u201d [Online]. Available: http:\/combinatoricswiki.org\/wiki\/The_Degree_Diameter_Problem_for_General_Graphs"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] W.G. Brown, \u201cOn graphs that do not contain a Thomsen graph,\u201d Canadian Mathematical Bulletin, vol.9, pp.281-285, Jan. 1966. 10.4153\/cmb-1966-036-2","DOI":"10.4153\/CMB-1966-036-2"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] E. Loz and G. Pineda-Villavicencio, \u201cNew benchmarks for large-scale networks with given maximum degree and diameter,\u201d The Computer Journal, vol.53, no.7, pp.1092-1105, Sept. 2010. 10.1093\/comjnl\/bxp091","DOI":"10.1093\/comjnl\/bxp091"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] M. Miller and J. \u0160ir\u00e1\u0148, \u201cMoore graphs and beyond: A survey of the degree\/diameter problem,\u201d The Electronic Journal of Combinatorics, Dynamic Survey #DS14, 92 pages, May 2013.","DOI":"10.37236\/35"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] T. Kitasuka and M. Iida, \u201cA heuristic method of generating diameter 3 graphs for order\/degree problem,\u201d Proc. 10th IEEE\/ACM International Symposium on Networks-on-Chip (NOCS 2016), 6 pages, Sept. 2016. 10.1109\/nocs.2016.7579334","DOI":"10.1109\/NOCS.2016.7579334"},{"key":"15","unstructured":"[15] I. Kawamata, \u201cApproximate evaluation and voltage assignment for order\/degree problem,\u201d Graph Golf Workshop, Nov. 2017, [Online]. Available: http:\/\/research.nii.ac.jp\/graphgolf\/2017\/candar17\/"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/12\/E101.D_2018PAP0008\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,16]],"date-time":"2020-11-16T12:43:15Z","timestamp":1605530595000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/12\/E101.D_2018PAP0008\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,1]]},"references-count":15,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018pap0008","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,1]]}}}