{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:43:09Z","timestamp":1648618989582},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0012-365x(93)90363-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"147-157","source":"Crossref","is-referenced-by-count":26,"title":["Double commutative-step digraphs with minimum diameters"],"prefix":"10.1016","volume":"114","author":[{"given":"P.","family":"Esqu\u00e9","sequence":"first","affiliation":[]},{"given":"F.","family":"Aguil\u00f3","sequence":"additional","affiliation":[]},{"given":"M.A.","family":"Fiol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90363-X_BIB1","doi-asserted-by":"crossref","unstructured":"J.-C. Bermond, F. Comellas and D.F. Hsu, Distributed loop computer networks: a survey J. Parallel Distributed Comput., to appear.","DOI":"10.1006\/jpdc.1995.1002"},{"key":"10.1016\/0012-365X(93)90363-X_BIB2","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\/0012-365X(93)90363-X_BIB3","doi-asserted-by":"crossref","unstructured":"P. Erd\u0151s and D.F. Hsu, Distributed loop networks with minimum transmission delay, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(92)90370-U"},{"key":"10.1016\/0012-365X(93)90363-X_BIB4","series-title":"Ph.D. Thesis","article-title":"Aplicaciones de la Teor\u00eda de Grafos al Dise\u00f1o de Redes de Interconexi\u00f3n de Multiprocesadores (in Spanish)","author":"Fiol","year":"1982"},{"key":"10.1016\/0012-365X(93)90363-X_BIB5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(87)90170-1","article-title":"Congruences in Zn, Finite Abelian groups and the Chinese remainder theorem","volume":"64","author":"Fiol","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90363-X_BIB6","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\/0012-365X(93)90363-X_BIB7","first-page":"319","article-title":"A higly reliable distributed loop network architecture","author":"Grnarov","year":"1980","journal-title":"Proc. 1980 Internat. Symp. Fault-Tolerant Comput., Kyoto"},{"key":"10.1016\/0012-365X(93)90363-X_BIB8","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/TC.1987.1676914","article-title":"Comments on \u2018Reliable loop topologies for large local computer networks\u2019","volume":"C-36","author":"Hwang","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0012-365X(93)90363-X_BIB9","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\/0012-365X(93)90363-X_BIB10","article-title":"Integral Matrices","volume":"Vol. 45","author":"Newman","year":"1972"},{"key":"10.1016\/0012-365X(93)90363-X_BIB11","first-page":"218","article-title":"Optimal loop topologies for distributed systems","author":"Raghavendra","year":"1981","journal-title":"Proc. 7th Data Commun. Symp., Mexico City"},{"key":"10.1016\/0012-365X(93)90363-X_BIB12","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\/0012-365X(93)90363-X_BIB13","first-page":"6.29, 6.34","article-title":"A distributed double-loop computer network","author":"Wolf","year":"1978","journal-title":"Proc. 7th Texas Conf. Comput. Systems, USA"},{"key":"10.1016\/0012-365X(93)90363-X_BIB14","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":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390363X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390363X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:53:02Z","timestamp":1555134782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390363X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0012365X9390363X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90363-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}