{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:17:22Z","timestamp":1712301442590},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":6163,"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":[[1996,9]]},"DOI":"10.1016\/0012-365x(94)00302-y","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"113-140","source":"Crossref","is-referenced-by-count":6,"title":["Reordered gossip schemes"],"prefix":"10.1016","volume":"156","author":[{"given":"David W.","family":"Krumme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00302-Y_BIB1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(72)90001-5","article-title":"Gossips and telephones","volume":"2","author":"Baker","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0602002","article-title":"A problem with telephones","volume":"2","author":"Bumby","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(94)00302-Y_BIB3","article-title":"Label-connected graphs- an overview","author":"Burosch","year":"1992"},{"key":"10.1016\/0012-365X(94)00302-Y_BIB4","first-page":"52","article-title":"On the possibility of information propagation on graphs","volume":"37","author":"Burosch","year":"1988","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB5","series-title":"Proc. Seventh SE Conf. Combinatorics, Graph Theory, and Computing","first-page":"239","article-title":"Extensions of the telephone problem","author":"Cot","year":"1976"},{"key":"10.1016\/0012-365X(94)00302-Y_BIB6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0016-0032(79)90004-8","article-title":"Gossips and telegraphs","volume":"307","author":"Entringer","year":"1979","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(91)90068-D","article-title":"Label-connected graphs and the gossip problem","volume":"87","author":"G\u00f6bel","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.4153\/CMB-1972-081-0","article-title":"A cure for the telephone disease","volume":"15","author":"Hajnal","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/0016-0032(74)90126-4","article-title":"The communication problem on graphs and digraphs","volume":"297","author":"Harary","year":"1974","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB10","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\/0012-365X(94)00302-Y_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(80)90116-8","article-title":"Further gossip problems","volume":"30","author":"Kleitman","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB12","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."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB13","article-title":"Kernels of minimum size gossip schemes","author":"Labahn","year":"1992"},{"key":"10.1016\/0012-365X(94)00302-Y_BIB14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(93)90509-R","article-title":"Information flows on hypergraphs","volume":"113","author":"Labahn","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00302-Y_BIB15","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0220027","article-title":"The communication complexity of atomic commitment and of gossiping","volume":"20","author":"Wolfson","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400302Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400302Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:20:15Z","timestamp":1556666415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400302Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0012365X9400302Y"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00302-y","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}