{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T09:15:14Z","timestamp":1683796514577},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0166-218x(01)00245-1","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T07:06:34Z","timestamp":1034319994000},"page":"61-72","source":"Crossref","is-referenced-by-count":13,"title":["A simple algorithm to find the steps of double-loop networks"],"prefix":"10.1016","volume":"121","author":[{"given":"Robin","family":"Chi-Feng Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiuyuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Xin","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00245-1_BIB1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(95)94025-8","article-title":"An efficient algorithm to find optimal double loop networks","volume":"138","author":"Aguil\u00f3","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: a survey","volume":"24","author":"Bermond","year":"1995","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB3","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1109\/12.869331","article-title":"The minimum distance diagram of double-loop networks","volume":"49","author":"Chen","year":"2000","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB4","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1002\/1097-0037(200009)36:2<118::AID-NET7>3.0.CO;2-1","article-title":"Equivalent nondegenerate L-shapes of double-loop networks","volume":"36","author":"Chen","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00245-1_BIB5","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0196-6774(88)90030-2","article-title":"Diameters of weighted double loop networks","volume":"9","author":"Cheng","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00245-1_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(92)90370-U","article-title":"Distributed loop networks with minimum transmission delay","volume":"100","author":"Erd\u00f6s","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB7","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0012-365X(93)90363-X","article-title":"Double commutative-step diagraphs with minimum diameters","volume":"114","author":"Esqu\u00e9","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB8","unstructured":"M.A. Fiol, M. Valero, J.L.A. Yebra, I. Alegre, T. Lang, Optimization of double-loop structures for local networks, Proceedings of the XIX International Symposium MIMI\u201982, Paris, France, 1982, pp. 37\u201341."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB9","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TC.1987.1676963","article-title":"A discrete optimization problem in local networks and data alignment","volume":"C-36","author":"Fiol","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB10","doi-asserted-by":"crossref","unstructured":"F.K. Hwang, A survey on double-loop networks, in: F. Roberts, F.K. Hwang, C. Monma (Eds.), Reliability of Computer and Communication Networks, AMS Series, 1991, pp. 143\u2013151.","DOI":"10.1090\/dimacs\/005\/09"},{"key":"10.1016\/S0166-218X(01)00245-1_BIB11","doi-asserted-by":"crossref","unstructured":"F.K. Hwang, A complementary survey on double-loop networks, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(00)00243-7"},{"key":"10.1016\/S0166-218X(01)00245-1_BIB12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(87)90123-3","article-title":"Double loop networks with minimum delay","volume":"66","author":"Hwang","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB13","unstructured":"M. Newman, Integral Matrices, Pure and Appl. Math. Series, Vol. 45, Academic Press, New York, 1972."},{"key":"10.1016\/S0166-218X(01)00245-1_BIB14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/90.330417","article-title":"Analyzing the fault tolerance of double-loop networks","volume":"2","author":"Peha","year":"1994","journal-title":"IEEE Trans. Network"},{"key":"10.1016\/S0166-218X(01)00245-1_BIB15","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","article-title":"A combinatorial problem related to multimodule memory organizations","volume":"21","author":"Wong","year":"1974","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T14:29:26Z","timestamp":1555165766000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0166218X01002451"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00245-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}