{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:40:40Z","timestamp":1774593640257,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T00:00:00Z","timestamp":1650067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T00:00:00Z","timestamp":1650067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-022-02489-9","type":"journal-article","created":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T16:04:10Z","timestamp":1650125050000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Greedy Routing in Circulant Networks"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3569-3885","authenticated-orcid":false,"given":"Hebert","family":"P\u00e9rez-Ros\u00e9s","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3481-004X","authenticated-orcid":false,"given":"Maria","family":"Bras-Amor\u00f3s","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Miguel","family":"Serradilla-Merinero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,16]]},"reference":[{"key":"2489_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejc.2009.05.002","volume":"31","author":"A Adamaszek","year":"2010","unstructured":"Adamaszek, A., Adamaszek, M.: Combinatorics of the change-making problem. Eur. J. Combin. 31, 47\u201363 (2010)","journal-title":"Eur. J. Combin."},{"key":"2489_CR2","doi-asserted-by":"publisher","first-page":"R9","DOI":"10.37236\/1347","volume":"5","author":"L Brankovi\u0107","year":"1998","unstructured":"Brankovi\u0107, L., Miller, M., Plesn\u00edk, J., Ryan, J., \u0160ir\u00e1n, J.: A note on constructing large Cayley graphs of given degree and diameter by voltage assignments. Electron. J. Combin. 5, R9 (1998)","journal-title":"Electron. J. Combin."},{"key":"2489_CR3","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","volume":"32","author":"FT Boesch","year":"1985","unstructured":"Boesch, F.T., Wang, J.F.: Reliable circulant networks with minimal transmission delay. IEEE Trans. Circ. Syst. 32, 1286\u20131291 (1985)","journal-title":"IEEE Trans. Circ. Syst."},{"key":"2489_CR4","doi-asserted-by":"crossref","unstructured":"Cai,\u00a0X.: Canonical coin systems for change-making problems. In: Proceedings of the 9th IEEE International Conference on Hybrid Intelligent Systems, pp. 499\u2013504 (2009)","DOI":"10.1109\/HIS.2009.103"},{"key":"2489_CR5","unstructured":"Chang,\u00a0H.-W., Chen, S.-Y.: New families of triple-loop networks. In: Proceedings of the 2004 IEEE Asia-Pacific Conference on Circuits and Systems, pp. 893\u2013896 (2004)"},{"issue":"3","key":"2489_CR6","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/S0895480100372899","volume":"17","author":"R Dougherty","year":"2004","unstructured":"Dougherty, R., Faber, V.: The degree diameter problem for several varieties of Cayley graphs I: the Abelian case. SIAM J. Discret. Math. 17(3), 478\u2013519 (2004)","journal-title":"SIAM J. Discret. Math."},{"key":"2489_CR7","doi-asserted-by":"crossref","unstructured":"Elspas,\u00a0B.: Topological constraints on interconnection-limited logic. In: Proceedings the 5th Annual IEEE Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey, USA, pp. 133\u2013137 (1964)","DOI":"10.1109\/SWCT.1964.27"},{"key":"2489_CR8","unstructured":"Feria-Puron,\u00a0R.,\u00a0P\u00e9rez-Ros\u00e9s, H., Ryan, J.: Searching for large circulant graphs. arXiv:1503.07357v1"},{"key":"2489_CR9","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Hadzilacos, V.: On the complexity of greedy routing in ring-based peer-to-peer networks. In: Proceedings of PODC 2007, pp. 99\u2013108","DOI":"10.1145\/1281100.1281117"},{"key":"2489_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2007.04.002","volume":"381","author":"D G\u00f3mez","year":"2007","unstructured":"G\u00f3mez, D., Guti\u00e9rrez, J., Ibeas, A.: Optimal routing in double loop networks. Theoret. Comput. Sci. 381, 68\u201385 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"2489_CR11","doi-asserted-by":"crossref","unstructured":"Hafner,\u00a0P.R.: Large Cayley graphs and digraphs with small degree and diameter. Research Report CDMTCS-005, University of Auckland, New Zealand (1995)","DOI":"10.1007\/978-94-017-1108-1_21"},{"key":"2489_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(01)00341-3","volume":"299","author":"FK Hwang","year":"2003","unstructured":"Hwang, F.K.: A survey on multi-loop networks. Theoret. Comput. Sci. 299, 107\u2013121 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"2489_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.37236\/4279","volume":"21","author":"R Lewis","year":"2014","unstructured":"Lewis, R.: The degree-diameter problem for circulant graphs of degree 8 and 9. Electron. J. Combin. 21, 4 (2014)","journal-title":"Electron. J. Combin."},{"key":"2489_CR14","doi-asserted-by":"publisher","first-page":"2553","DOI":"10.1016\/j.disc.2018.05.024","volume":"341","author":"R Lewis","year":"2018","unstructured":"Lewis, R.: The degree-diameter problem for circulant graphs of degree 10 and 11. Discret. Math. 341, 2553\u20132566 (2018)","journal-title":"Discret. Math."},{"key":"2489_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.dam.2017.04.018","volume":"231","author":"N L\u00f3pez","year":"2017","unstructured":"L\u00f3pez, N., P\u00e9rez-Ros\u00e9s, H., Pujol\u00e0s, J.: The degree\/diameter problem for mixed abelian Cayley graphs. Discret. Appl. Math. 231, 190\u2013197 (2017)","journal-title":"Discret. Appl. Math."},{"key":"2489_CR16","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.20439","volume":"64","author":"H Machbeth","year":"2009","unstructured":"Machbeth, H., \u0160iagiov\u00e1, J., \u0160ir\u00e1\u0148, J., Vetr\u00edk, T.: Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter. J. Graph Theory 64, 87\u201398 (2009)","journal-title":"J. Graph Theory"},{"key":"2489_CR17","unstructured":"Mart\u00ednez,\u00a0C.,\u00a0Beivide, R.,\u00a0Izu, C., Alonso, J.M.: Characterization of the class of optimal dense circulant graphs of degree four. In: Proceedings of the XIV Jornadas de Paralelismo, Legan\u00e9s, Madrid, Spain (2003)"},{"key":"2489_CR18","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1016\/j.dam.2012.03.035","volume":"160","author":"M Miller","year":"2012","unstructured":"Miller, M., P\u00e9rez-Ros\u00e9s, H., Ryan, J.: The maximum degree and diameter-bounded subgraph in the mesh. Discret. Appl. Math. 160, 1782\u20131790 (2012)","journal-title":"Discret. Appl. Math."},{"key":"2489_CR19","first-page":"1","volume":"14","author":"M Miller","year":"2013","unstructured":"Miller, M., \u0160ir\u00e1\u0148, J.: Moore graphs and beyond: a survey of the degree-diameter problem. Electron. J. Combin. Dyn. Surv. 14, 1\u201361 (2013)","journal-title":"Electron. J. Combin. Dyn. Surv."},{"key":"2489_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830912500024","volume":"4","author":"EA Monakhova","year":"2012","unstructured":"Monakhova, E.A.: A survey on undirected circulant graphs. Discret. Math. Algorithms Appl. 4, 1 (2012)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"2489_CR21","first-page":"20","volume":"20","author":"EA Monakhova","year":"2020","unstructured":"Monakhova, E.A., Romanov, AYu., Lezhnev, E.V.: Shortest path search algorithm in optimal two-dimensional circulant networks: implementation for networks-on-chip. IEEE Access 20, 20 (2020)","journal-title":"IEEE Access"},{"key":"2489_CR22","doi-asserted-by":"crossref","unstructured":"Muga, F.P., II.: Undirected circulant graphs. In: Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), pp. 113\u2013118 (1994)","DOI":"10.1109\/ISPAN.1994.367157"},{"issue":"88","key":"2489_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/S0024611503014412","volume":"3","author":"M Muzychuk","year":"2004","unstructured":"Muzychuk, M.: A solution of the isomorphism problem for circulant graphs. Proc. Lond. Math. Soc. 3(88), 1\u201341 (2004)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2489_CR24","unstructured":"OEIS: The On-Line Encyclopedia of Integer Sequences. http:\/\/oeis.org\/classic\/index.html"},{"key":"2489_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.orl.2004.06.001","volume":"33","author":"D Pearson","year":"2005","unstructured":"Pearson, D.: A polynomial-time algorithm for the change-making problem. Oper. Res. Lett. 33, 231\u2013234 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"2489_CR26","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BF02984830","volume":"25","author":"J Shallit","year":"2003","unstructured":"Shallit, J.: What this country needs is an 18c piece. Math. Intell. 25(2), 20\u201323 (2003)","journal-title":"Math. Intell."},{"key":"2489_CR27","first-page":"Art. 03.1.5","volume":"6","author":"R Sulanke","year":"2003","unstructured":"Sulanke, R.: Objects counted by the central Delannoy numbers. J. Integer Sequences 6, Art. 03.1.5 (2003)","journal-title":"J. Integer Sequences"},{"key":"2489_CR28","unstructured":"The Degree$$\/$$Diameter Problem. http:\/\/combinatoricswiki.org\/wiki\/The_Degree\/Diameter_Problem"},{"key":"2489_CR29","unstructured":"The Degree$$\/$$Diameter Problem For Circulant Graphs. http:\/\/combinatoricswiki.org\/wiki\/The_Degree_Diameter_Problem_for_Circulant_Graphs"},{"issue":"4","key":"2489_CR30","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/net.20327","volume":"55","author":"A Thomson","year":"2010","unstructured":"Thomson, A., Zhou, S.: Gossiping and routing in undirected triple-loop networks. Networks 55(4), 341\u2013349 (2010)","journal-title":"Networks"},{"key":"2489_CR31","first-page":"153","volume":"81","author":"MV Vassilev-Missana","year":"1987","unstructured":"Vassilev-Missana, M.V., Atanassov, K.T.: On Delanoy [sic] numbers. Annuaire Univ. Sofia Fac. Math. Inform. 81, 153\u2013162 (1987)","journal-title":"Annuaire Univ. Sofia Fac. Math. Inform."},{"key":"2489_CR32","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.disc.2012.10.006","volume":"313","author":"T Vetr\u00edk","year":"2013","unstructured":"Vetr\u00edk, T.: Cayley graphs of given degree and diameters 3, 4 and 5. Discret. Math. 313, 213\u2013216 (2013)","journal-title":"Discret. Math."},{"key":"2489_CR33","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"CK Wong","year":"1974","unstructured":"Wong, C.K., Coppersmith, D.: A combinatorial problem related to multimodule memory organizations. J. ACM 21, 392\u2013402 (1974)","journal-title":"J. ACM"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02489-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02489-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02489-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T10:03:36Z","timestamp":1726999416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02489-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,16]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2489"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02489-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,16]]},"assertion":[{"value":"24 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"86"}}