{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:01Z","timestamp":1720640761857},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00050-2","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T15:21:27Z","timestamp":1097853687000},"page":"1-11","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A C.A.S. treatment of optimal-diameter double-loop digraphs families"],"prefix":"10.1016","volume":"11","author":[{"given":"F.","family":"Aguil\u00f3-Gost","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00050-2_NEWBIB1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(00)00304-6","article-title":"Discrete dynamics over double commutative-step digraphs","volume":"231","author":"Aguil\u00f3","year":"2000","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00050-2_NEWBIB2","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\/S1571-0653(04)00050-2_NEWBIB3","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\/S1571-0653(04)00050-2_NEWBIB4","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 Distrib. Comput"},{"key":"10.1016\/S1571-0653(04)00050-2_NEWBIB5","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\/S1571-0653(04)00050-2_NEWBIB6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0012-365X(93)90363-X","article-title":"Double commutative-step digraphs with minimum diameters","volume":"114","author":"Esqu\u00e9","year":"1993","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00050-2_NEWBIB7","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\/S1571-0653(04)00050-2_NEWBIB8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1090\/dimacs\/005\/09","article-title":"A survey on double loop networks","volume":"5","author":"Hwang","year":"1991","journal-title":"DIMACS Ser. in Discrete Math. and Theor. Comput. Sci"},{"key":"10.1016\/S1571-0653(04)00050-2_NEWBIB9","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\/S1571-0653(04)00050-2_NEWBIB10","series-title":"Pure Appl. Math. Ser. 45","article-title":"Integral Matrices","author":"Newman","year":"1972"},{"key":"10.1016\/S1571-0653(04)00050-2_NEWBIB11","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. Ass. Comput. Match"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000502?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T02:54:53Z","timestamp":1549162493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":11,"alternative-id":["S1571065304000502"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00050-2","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}