{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:22:08Z","timestamp":1649150528550},"reference-count":14,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":3578,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1570-8667(03)00038-8","type":"journal-article","created":{"date-parts":[[2003,11,27]],"date-time":"2003-11-27T12:12:55Z","timestamp":1069935175000},"page":"461-475","source":"Crossref","is-referenced-by-count":2,"title":["Optimal gossiping in paths and cycles"],"prefix":"10.1016","volume":"1","author":[{"given":"Francis C.M.","family":"Lau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.H.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1570-8667(03)00038-8_BIB001","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0166-218X(98)00022-5","article-title":"Optimal sequential gossiping by short messages","volume":"86","author":"Bermond","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S1570-8667(03)00038-8_BIB002","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1137\/S0097539795283619","article-title":"Fast gossiping by short messages","volume":"27","author":"Bermond","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1570-8667(03)00038-8_BIB003","series-title":"Proc. ICALP '95, Szeged, Hungary","first-page":"135","article-title":"Fast gossiping by short messages","author":"Bermond","year":"1995"},{"key":"10.1016\/S1570-8667(03)00038-8_BIB004","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/net.3230220402","article-title":"Sequential information dissemination by packets","volume":"22","author":"Bagchi","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S1570-8667(03)00038-8_BIB005","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/S0097539790192672","article-title":"Parallel information dissemination by packets","volume":"23","author":"Bagchi","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1570-8667(03)00038-8_BIB006","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/S0895480295292934","article-title":"Time and cost trade-offs in gossiping","volume":"11","author":"Czumaj","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S1570-8667(03)00038-8_BIB007","series-title":"Proc. Int. Conf. on Computer Design","first-page":"230","article-title":"Design of self-timed VLSI multicomputer communication controller","author":"Dally","year":"1987"},{"key":"10.1016\/S1570-8667(03)00038-8_BIB008","series-title":"Interconnection Networks: An Engineering Approach","author":"Duato","year":"1997"},{"key":"10.1016\/S1570-8667(03)00038-8_BIB009","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S1570-8667(03)00038-8_BIB010","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(93)90254-7","article-title":"Fast gossiping on square mesh computers","volume":"48","author":"Fujita","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S1570-8667(03)00038-8_BIB011","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S1570-8667(03)00038-8_BIB012","series-title":"Combinatorial Network Theory","first-page":"125","article-title":"Dissemination of information in interconnection networks (broadcasting & gossiping)","author":"Hromkovic\u0306","year":"1996"},{"issue":"2","key":"10.1016\/S1570-8667(03)00038-8_BIB013","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1137\/0221026","article-title":"Fast gossiping for the hypercube","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S1570-8667(03)00038-8_BIB014","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","article-title":"Gossiping in minimal time","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T17:58:06Z","timestamp":1550339886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":14,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S1570866703000388"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00038-8","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}