{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:20:28Z","timestamp":1775067628334,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0304-3975(01)00341-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"107-121","source":"Crossref","is-referenced-by-count":93,"title":["A survey on multi-loop networks"],"prefix":"10.1016","volume":"299","author":[{"given":"F.K.","family":"Hwang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00341-3_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(96)00213-0","article-title":"Triple loop networks with small transmission delay","volume":"167\/168","author":"Aguilo","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","article-title":"Analysis of chordal ring networks","volume":"30","author":"Arden","year":"1981","journal-title":"IEEE Trans. Comput. C"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB3","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. Para. Distr. Comput."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0095-8956(89)90040-3","article-title":"Hamiltonian decomposition of Cayley graph of degree four","volume":"46","author":"Bermond","year":"1989","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1111\/j.1749-6632.1989.tb22436.x","article-title":"An optimization problem in distributed loop computer networks","volume":"S55","author":"Bermond","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB6","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivity","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB7","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","article-title":"Reliable circulant networks with minimum transmission delay","volume":"32","author":"Boesch","year":"1985","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB8","unstructured":"C. Chen, F.K. Hwang, J.S. Lee, S.J. Shih, The existence of hyper-L shapes in triple-loop networks, preprint, 2001."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB9","unstructured":"M.Y. Chen, F.K. Hwang, C.H. Yen, Tessellating shapes in the plane, preprint, 2001."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB10","unstructured":"S.K. Chen, F.K. Hwang, Y.C. Liu, Mixed chordal rings, preprint, 2001."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230230407","article-title":"Undirected loop networks","volume":"23","author":"Chen","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB12","first-page":"401","article-title":"Diameters of weighted double loop networks","volume":"9","author":"Cheng","year":"1988","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/24.690897","article-title":"Ring-network reliability with a constrained number of consecutively-bypassed stations","volume":"47","author":"Dao","year":"1998","journal-title":"IEEE Trans. Rel."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.3190100103","article-title":"Connectivity of circulant graphs","volume":"10","author":"van Dorne","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(92)90370-U","article-title":"Distributed lo\u00f3p network with minimum transmission delay","volume":"100","author":"Erd\u00f6s","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB16","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0166-218X(97)00015-2","article-title":"Fault tolerant routings in double fixed-step networks","volume":"78","author":"F\u00e0brega","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB17","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":"36","author":"Fiol","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(81)90085-X","article-title":"Quelques problems de connexit\u00e8 dans les graphes orient\u00e8s","volume":"30","author":"Hamidoune","year":"1981","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB19","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/0403044","article-title":"Vertex transitivity and super line connectedness","volume":"3","author":"Hamidoune","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0895480190184811","article-title":"Extremal problems in the combinatorial construction of distributed loop networks","volume":"7","author":"Hsu","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0304-3975(00)00243-7","article-title":"A complementary survey of double loop networks","volume":"263","author":"Hwang","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB22","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1109\/12.477253","article-title":"Survival reliability of some double-loop networks ad chordal rings","volume":"44","author":"Hwang","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB23","first-page":"163","article-title":"Distributed Loop Computer Networks","volume":"Vol. 17","author":"Liu","year":"1981"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","article-title":"Minimale n-fach kantenzusamenh\u00e4ngende graphen","volume":"191","author":"Mader","year":"1971","journal-title":"Math. Ann."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0169-7552(86)90027-9","article-title":"A survey of multi-connected loop topologies for local computer networks","volume":"11","author":"Raghavendra","year":"1986","journal-title":"Comput. Network ISDN Syst."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","article-title":"The ring loading problem","volume":"11","author":"Schrijver","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB27","first-page":"23","article-title":"Connectivity of transitive graphs","volume":"8","author":"Watkins","year":"1970","journal-title":"J. Graph. Theory"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB28","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","article-title":"A combinatorial problem related to multimode memory organizations","volume":"21","author":"Wong","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00341-3_BIB29","first-page":"159","article-title":"The diameter of undirected graphs associated to plane tessellations","volume":"20B","author":"Yebra","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/S0304-3975(01)00341-3_BIB30","first-page":"226","article-title":"Computing the diameter in multiple-loop networks","volume":"14","author":"Zerovink","year":"1993","journal-title":"J. Algebra"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T04:25:40Z","timestamp":1553660740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397501003413"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00341-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}