{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:54Z","timestamp":1760245074121},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"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":[[1992,6]]},"DOI":"10.1016\/0304-3975(92)90370-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"223-241","source":"Crossref","is-referenced-by-count":39,"title":["Distributed loop network with minimum transmission delay"],"prefix":"10.1016","volume":"100","author":[{"given":"Paul","family":"Erd\u00f6s","sequence":"first","affiliation":[]},{"given":"D.Frank","family":"Hsu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90370-U_BIB1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","article-title":"Analysis of chordal ring","volume":"C-30","author":"Arden","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90370-U_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1111\/j.1749-6632.1989.tb22436.x","article-title":"An optimization problem in distributed loop computer networks","volume":"555","author":"Bermond","year":"1989","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0304-3975(92)90370-U_BIB3","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","article-title":"Reliable circulent networks with minimum transmission delay","volume":"CAS-32","author":"Boesch","year":"1985","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0304-3975(92)90370-U_BIB4","series-title":"Combinatorics and Graph Theory","first-page":"47","article-title":"On Hamiltonian consecutive-d digraphs","volume":"Vol. 25","author":"Du","year":"1989"},{"key":"10.1016\/0304-3975(92)90370-U_BIB5","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1109\/TC.1985.1676641","article-title":"Doubly linked ring networks","volume":"C-34","author":"Du","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90370-U_BIB6","unstructured":"D.Z. Du, D.F. Hsu, F.K. Hwang and X.M. Zhang, The Hamiltonian property of generalized deBruijn digraphs, J. Combin. Theory, to appear."},{"key":"10.1016\/0304-3975(92)90370-U_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/net.3230200204","article-title":"A combinatorial problem related to distributed loop networks","volume":"20","author":"Du","year":"1990","journal-title":"Networks"},{"key":"10.1016\/0304-3975(92)90370-U_BIB8","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\/0304-3975(92)90370-U_BIB9","first-page":"319","article-title":"A highly reliable, distributed loop network architecture","author":"Grnarov","year":"1980","journal-title":"Proc. 1980 Internat. Symp. on Fault-Tolerant Computing"},{"key":"10.1016\/0304-3975(92)90370-U_BIB10","doi-asserted-by":"crossref","unstructured":"D.F. Hsu and X.D. Jia, Extremal problems in the construction of distributed loop networks, SIAM J. Discrete Math., to appear.","DOI":"10.1137\/S0895480190184811"},{"key":"10.1016\/0304-3975(92)90370-U_BIB11","series-title":"Graph Theory, Combinatorics, Algorithms and Applications","first-page":"254","article-title":"A census of tight one-optimal double loop networks","author":"Hsu","year":"1991"},{"key":"10.1016\/0304-3975(92)90370-U_BIB12","unstructured":"D.F. Hsu and J. Shapiro, Bounds for the minimum number of transmission delays in double loop networks, J. Combin. Inform. System Sci., to appear."},{"key":"10.1016\/0304-3975(92)90370-U_BIB13","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","year":"1984"},{"key":"10.1016\/0304-3975(92)90370-U_BIB14","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\/0304-3975(92)90370-U_BIB15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize diameter on building-block network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90370-U_BIB16","unstructured":"P. Morillo,F. Comellas and M.A. Fiol, Diameter, mean distance and vulnerability of some graphs related to plane tesselations, to appear."},{"key":"10.1016\/0304-3975(92)90370-U_BIB17","first-page":"17","article-title":"The diameter of directed graphs associated to plane tesselations","volume":"20A","author":"Morillo","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0304-3975(92)90370-U_BIB18","first-page":"238","article-title":"Interconnection topologies for fault-tolerant parallel and distributed architectures","author":"Pradham","year":"1981","journal-title":"Proc. 1981 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(92)90370-U_BIB19","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1109\/TC.1982.1676101","article-title":"A fault-tolerant communication architecture for distributed systems","volume":"C-31","author":"Pradham","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90370-U_BIB20","first-page":"218","article-title":"Optimal loop topologies for distributed systems","author":"Raghavendra","year":"1981","journal-title":"Proc. 7th Data Communications Symposium"},{"key":"10.1016\/0304-3975(92)90370-U_BIB21","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TC.1985.1676514","article-title":"Reliable loop topologies for large local computer networks","volume":"C-34","author":"Raghavendra","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90370-U_BIB22","article-title":"Multi-connected loop topologies for local computer networks","author":"Raghavendra","year":"1982","journal-title":"Proc. INFOCOM'82"},{"key":"10.1016\/0304-3975(92)90370-U_BIB23","series-title":"Directed graphs with minimum diameter and maximal connectivity","author":"Reddy","year":"1980"},{"key":"10.1016\/0304-3975(92)90370-U_BIB24","first-page":"6.19","article-title":"A distributed double-loop computer network","author":"Wolf","year":"1978","journal-title":"Proc. 7th Texas Conf. on Computer Systems"},{"key":"10.1016\/0304-3975(92)90370-U_BIB25","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290370U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290370U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:58:37Z","timestamp":1555127917000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290370U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["030439759290370U"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90370-u","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}