{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:56:59Z","timestamp":1725494219277},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768364"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76837-1_39","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T05:25:50Z","timestamp":1194326750000},"page":"352-361","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm to Find Optimal Double-Loop Networks with Non-unit Steps"],"prefix":"10.1007","author":[{"given":"Xiaoping","family":"Dai","sequence":"first","affiliation":[]},{"given":"Jianqin","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Kaihou","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0012-365X(95)94025-8","volume":"138","author":"F. Aguil\u00f3","year":"1995","unstructured":"Aguil\u00f3, F., Fiol, M.A.: An efficient algorithm to find optimal double loop networks. Discrete Mathematics\u00a0138, 15\u201329 (1995)","journal-title":"Discrete Mathematics"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Aguil\u00f3, F., Sim\u00f3, E., Zaragoz\u00e1, M.: Optimal double-loop networks with non-unit steps. The Electronic Journal of Combinatorics\u00a010, $\\sharp$ R2(2003)","DOI":"10.37236\/1695"},{"key":"39_CR3","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. J. Parallel Distribut. Comput.\u00a024, 2\u201310 (1995)","journal-title":"J. Parallel Distribut. Comput."},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0166-218X(01)00245-1","volume":"121","author":"C.F. Chan","year":"2002","unstructured":"Chan, C.F., Chen, C., Hong, Z.X.: A simple algorithm to find the steps of double-loop networks. Discrete Applied Mathematics\u00a0121, 61\u201372 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(92)90370-U","volume":"100","author":"P. Erd\u00f6s","year":"1992","unstructured":"Erd\u00f6s, P., Hsu, D.F.: Distributed loop networks with minimum transmission delay. Theoret. Comput. Sci.\u00a0100, 223\u2013241 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0012-365X(93)90363-X","volume":"114","author":"P. Esqu\u00e9","year":"1993","unstructured":"Esqu\u00e9, P., Aguil\u00f3, F., Fiol, M.A.: Double commutative-step digraphs with minimum diameters. Discrete Mathematics\u00a0114, 147\u2013157 (1993)","journal-title":"Discrete Mathematics"},{"key":"39_CR7","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. Theoret. Comput. Sci.\u00a0263, 211\u2013229 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TC.1987.1676963","volume":"36","author":"M.A. Fiol","year":"1987","unstructured":"Fiol, M.A., Yebra, J.L.A., Alegre, I., Valero, M.: A discrete optimization problem in local networks and data alignment. IEEE Trans. Comput.\u00a0C-36, 702\u2013713 (1987)","journal-title":"IEEE Trans. Comput."},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0166-218X(93)90028-M","volume":"46","author":"Q. Li","year":"1993","unstructured":"Li, Q., Xu, J., Zhang, Z.: The infinite families of optimal double loop networks. Discrete Applied Mathematics\u00a046, 179\u2013183 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"39_CR10","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"C.K. Wong","year":"1974","unstructured":"Wong, C.K., Coppersmith, D.: A combinatorial problem related to multimode memory organizations. J. Ass. Comput. Mach.\u00a021, 392\u2013402 (1974)","journal-title":"J. Ass. Comput. Mach."},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/BF02917398","volume":"42","author":"J.. Xu","year":"1999","unstructured":"Xu, J.: Designing of optimal double loop networks. Science in China, Series E\u00a0E-42(5), 462\u2013469 (1999)","journal-title":"Science in China, Series E"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1360\/03ys9015","volume":"1","author":"J. Xu","year":"2003","unstructured":"Xu, J., Liu, Q.: An infinite family of 4-tight optimal double loop networks. Science in China, Series A\u00a0A-46(1), 139\u2013143 (2003)","journal-title":"Science in China, Series A"},{"key":"39_CR13","unstructured":"Zhou, J., Xu, X.: On infinite families of optimal double-loop networks with non-unit steps, Ars Combinatoria (accepted)"}],"container-title":["Lecture Notes in Computer Science","Advanced Parallel Processing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76837-1_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:08:03Z","timestamp":1606165683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76837-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540768364"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76837-1_39","relation":{},"subject":[]}}