{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:48:19Z","timestamp":1742388499816},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_79","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"777-786","source":"Crossref","is-referenced-by-count":7,"title":["On Finding a Shortest Path in Circulant Graphs with Two Jumps"],"prefix":"10.1007","author":[{"given":"Domingo","family":"G\u00f3mez","sequence":"first","affiliation":[]},{"given":"Jaime","family":"Gutierrez","sequence":"additional","affiliation":[]},{"given":"\u00c1lvar","family":"Ibeas","sequence":"additional","affiliation":[]},{"given":"Carmen","family":"Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"Ram\u00f3n","family":"Beivide","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"79_CR1","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/12.93744","volume":"C-40","author":"R. Beivide","year":"1991","unstructured":"Beivide, R., Herrada, E., Balc\u00e1zar, J.L., Arruabarrena, A.: Optimal Distance Networks of Low Degree for Parallel Computers. IEEE Transactions on Computers\u00a0C-40(10), 1109\u20131124 (1991)","journal-title":"IEEE Transactions on Computers"},{"key":"79_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J.-C. Bermond","year":"1995","unstructured":"Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed Loop Computer Networks: A Survey. Journal of Parallel and Distributed Computing\u00a024, 2\u201310 (1995)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"79_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F.T. Boesch","year":"1984","unstructured":"Boesch, F.T., Tindell, R.: Circulants and their connectivity. J. Graph Theory\u00a08, 487\u2013499 (1984)","journal-title":"J. Graph Theory"},{"key":"79_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-48686-0_36","volume-title":"Computing and Combinatorics","author":"J.-Y. Cai","year":"1999","unstructured":"Cai, J.-Y., Havas, G., Mans, B., Nerurkar, A., Seifert, J.-P., Shparlinski, I.E.: On routing in circulant graphs. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 360\u2013369. Springer, Heidelberg (1999)"},{"key":"79_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0020-0190(98)00099-4","volume":"67","author":"N. Chalamaiah","year":"1998","unstructured":"Chalamaiah, N., Ramamurthy, B.: Finding shortest paths in distributed loop networks. Information Processing Letters\u00a067, 157\u2013161 (1998)","journal-title":"Information Processing Letters"},{"key":"79_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0196-6774(88)90030-2","volume":"9","author":"Y. Cheng","year":"1988","unstructured":"Cheng, Y., Hwang, F.K.: Diameters ofWeighted Double Loop Networks. Journal of Algorithms\u00a09, 401\u2013410 (1988)","journal-title":"Journal of Algorithms"},{"key":"79_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer, Berlin (1993)"},{"issue":"5","key":"79_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0020-0190(98)00013-1","volume":"65","author":"D.J. Guan","year":"1998","unstructured":"Guan, D.J.: An Optimal Message Routing Algorithm for Double-Loop Networks. Information Processing Letters\u00a065(5), 255\u2013260 (1998)","journal-title":"Information Processing Letters"},{"key":"79_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(00)00243-7","volume":"263","author":"F.K. Hwang","year":"2001","unstructured":"Hwang, F.K.: A complementary survey on double-loop networks. Theoretical Computer Science\u00a0263, 211\u2013229 (2001)","journal-title":"Theoretical Computer Science"},{"key":"79_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(01)00341-3","volume":"299","author":"F.K. Hwang","year":"2003","unstructured":"Hwang, F.K.: A survey on multi-loop networks. Theoretical Computer Science\u00a0299, 107\u2013121 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"79_CR11","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jagm.1996.0059","volume":"21","author":"M. Kaib","year":"1996","unstructured":"Kaib, M., Schnorr, C.P.: The Generalized Gauss Reduction Algorithm. Journal of Algorithms\u00a021(3), 565\u2013578 (1996)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"79_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkoswski\u2019s convex body theorem and integer programing. Mathematics of operation research\u00a012(3), 415\u2013440 (1987)","journal-title":"Mathematics of operation research"},{"key":"79_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"K. Lenstra","year":"1982","unstructured":"Lenstra, K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"issue":"3","key":"79_CR14","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.17.3.751","volume":"17","author":"L. Lov\u00e1sz","year":"1992","unstructured":"Lov\u00e1sz, L., Scarf, H.: The Generalized Basis Reduction Algorithm. Mathematics of Operations Research\u00a017(3), 751\u2013764 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"79_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jpdc.1997.1389","volume":"46","author":"B. Mans","year":"1997","unstructured":"Mans, B.: Optimal Distributed algorithms in unlabeled tori and chordal rings. Journal of Parallel and Distributed Computing\u00a046, 80\u201390 (1997)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"79_CR16","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattices Problems. The Kluwer International Series in Engineering and Computer Science, vol.\u00a0671 (2002)","DOI":"10.1007\/978-1-4615-0897-7"},{"issue":"12","key":"79_CR17","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1109\/12.477250","volume":"44","author":"K. Mukhopadhyaya","year":"1995","unstructured":"Mukhopadhyaya, K., Sinha, B.P.: Fault-Tolerant Routing Algorithm in distributed Loop Networks. IEEE Transactions on Computers\u00a044(12), 1452\u20131456 (1995)","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"79_CR18","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/12.926162","volume":"50","author":"Y.-L. Liu","year":"2001","unstructured":"Liu, Y.-L., Wang, Y.-L., Guan, D.J.: An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks. IEEE Transactions on Computers\u00a050(5), 500\u2013505 (2001)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"79_CR19","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1006\/jagm.1993.1011","volume":"14","author":"J. \u017derovnik","year":"1993","unstructured":"\u017derovnik, J., Pisanski, T.: Computing the Diameter in Multiple-Loop Networks. J. Algorithms\u00a014(2), 226\u2013243 (1993)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T22:56:07Z","timestamp":1553554567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11533719_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}