{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T09:20:15Z","timestamp":1683796815244},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":6713,"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":[[1995,3]]},"DOI":"10.1016\/0012-365x(95)94025-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"15-29","source":"Crossref","is-referenced-by-count":31,"title":["An efficient algorithm to find optimal double loop networks"],"prefix":"10.1016","volume":"138","author":[{"given":"F.","family":"Aguil\u00f3","sequence":"first","affiliation":[]},{"given":"M.A.","family":"Fiol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)94025-8_BIB1","series-title":"Workshop on Interconnection Networks","article-title":"k-tight double fixed step digraphs","author":"Aguil\u00f3","year":"1991"},{"key":"10.1016\/0012-365X(95)94025-8_BIB2","article-title":"Distributed loop computer networks: a survey","volume":"23","author":"Bermond","year":"1994","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/0012-365X(95)94025-8_BIB3","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(95)94025-8_BIB4","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\/0012-365X(95)94025-8_BIB5","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\/0012-365X(95)94025-8_BIB6","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":"67","author":"Fiol","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)94025-8_BIB7","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","author":"Fiol","year":"1987","journal-title":"IEEE Trans. Comput. C-36"},{"key":"10.1016\/0012-365X(95)94025-8_BIB8","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. Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/0012-365X(95)94025-8_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(95)94025-8_BIB10","article-title":"The Art of Computer Programming","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0012-365X(95)94025-8_BIB11","article-title":"Integral Matrices","volume":"45","author":"Newman","year":"1972"},{"key":"10.1016\/0012-365X(95)94025-8_BIB12","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/321832.321838","article-title":"A combinatorial problem related to multi-mode memory organizations","volume":"21","author":"Wong","year":"1974","journal-title":"J. Assoc. Comput. Match."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95940258?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95940258?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:21:54Z","timestamp":1556130114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95940258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0012365X95940258"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)94025-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}