{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:47:09Z","timestamp":1754153229910,"version":"3.41.2"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["25-11-00248"],"award-info":[{"award-number":["25-11-00248"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3579790","type":"journal-article","created":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T15:00:12Z","timestamp":1750086012000},"page":"104716-104727","source":"Crossref","is-referenced-by-count":0,"title":["A New Approach for Automatic Search for Families of Optimal Undirected Double-Loop Networks"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6814-4655","authenticated-orcid":false,"given":"Emilia A.","family":"Monakhova","sequence":"first","affiliation":[{"name":"Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, Novosibirsk, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8316-418X","authenticated-orcid":false,"given":"Oleg G.","family":"Monakhov","sequence":"additional","affiliation":[{"name":"Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, Novosibirsk, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3504-7429","authenticated-orcid":false,"given":"Edward R.","family":"Rzaev","sequence":"additional","affiliation":[{"name":"HSE University, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5970-2125","authenticated-orcid":false,"given":"Aleksandr A.","family":"Amerikanov","sequence":"additional","affiliation":[{"name":"HSE University, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1604-3333","authenticated-orcid":false,"given":"Mikhail Y.","family":"Romashikhin","sequence":"additional","affiliation":[{"name":"HSE University, Moscow, Russia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9410-9431","authenticated-orcid":false,"given":"Aleksandr Y.","family":"Romanov","sequence":"additional","affiliation":[{"name":"HSE University, Moscow, Russia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00341-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00361-L"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1985.1085667"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04396-5"},{"article-title":"Analysis and construction of extremal circulant and other Abelian Cayley graphs","year":"2021","author":"Lewis","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-022-02489-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3390\/math10214016"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.12.001"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3211985"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-006-0014-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2314689"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s12555-021-0564-4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.108636"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.02.061"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.124929"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.57"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200204"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210403"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265905001289"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.377"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2991\/icmemtc-16.2016.319"},{"key":"ref24","article-title":"A new approach for computing the distance and the diameter in circulant graphs","author":"Loudiki","year":"2022","journal-title":"arXiv:2210.11116"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3140329"},{"key":"ref26","first-page":"81","article-title":"On the analytical description of the optimal two-dimensional diophantine structures of homogeneous computing systems","volume":"90","author":"Monakhova","year":"1981","journal-title":"Comput. Syst. Quest. Theory Constr."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-020-03216-y"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1989.tb22436.x"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/12.93744"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/30350.30369"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.77"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3040323"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/71.536939"},{"issue":"80","key":"ref34","first-page":"18","article-title":"Synthesis of optimal Diophantine structures","author":"Monakhova","year":"1979","journal-title":"Comput. Syst., Questions Theory Construct."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1049\/ip-e.1990.0038"},{"key":"ref36","first-page":"159","article-title":"The diameter of undirected graphs associated to plane tessellations","author":"Yebra","year":"1985","journal-title":"Ars Combinatoria"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-01622-1_33"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265913500023"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.09.021"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.08.027"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/11599463_31"},{"issue":"1","key":"ref42","first-page":"75","article-title":"The tight optimal infinite families of undirected double-loop networks","volume":"22","author":"Liu","year":"2002","journal-title":"Syst. Eng. Theory Pract."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210102"},{"key":"ref44","first-page":"450","article-title":"Optimal circulant computer networks","volume-title":"Proc. Int. Conf. Parallel Comput. Technol. (PaCT)","author":"Monakhova"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/12.477250"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3390\/bdcc7020080"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.17587\/prin.15.402-410"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970920"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-29927-8_31"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2973303"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2019.1597174"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84522-3_7"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.nancom.2019.01.005"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-019-01262-2"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4274-5_7"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2019.e01516"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.3390\/mi14010141"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2020.e04427"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1134\/S1990478924010113"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11036794.pdf?arnumber=11036794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T18:07:21Z","timestamp":1753207641000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11036794\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3579790","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}