{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:47Z","timestamp":1725664247090},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580782"},{"type":"electronic","value":"9783540484356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58078-6_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:10:28Z","timestamp":1330269028000},"page":"251-265","source":"Crossref","is-referenced-by-count":1,"title":["Representations of gossip schemes"],"prefix":"10.1007","author":[{"given":"David W.","family":"Krumme","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0602002","volume":"2","author":"R.T. Bumby","year":"1981","unstructured":"R.T. Bumby, A problem with telephones, SIAM J. Algebraic Discrete Methods 2 (1981) 13\u201318.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"21_CR2","first-page":"52","volume":"37","author":"G. Burosch","year":"1988","unstructured":"G. Burosch, V.K. Leont'ev, and A.S. Markosyan, On the possibility of information propagation on graphs, Soviet Math. Doklady 37 (1988) 52\u201355.","journal-title":"Soviet Math. Doklady"},{"key":"21_CR3","volume-title":"Technical Report 898","author":"G. Burosch","year":"1992","unstructured":"G. Burosch and J.M. Laborde, Label-connected graphs \u2014 an overview, Technical Report 898, Institut Imag, Grenoble, France, 1992."},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0016-0032(79)90004-8","volume":"307","author":"R.C. Entringer","year":"1979","unstructured":"R.C. Entringer and P.J. Slater, Gossips and telegraphs, J. Franklin Institute 307 (1979) 353\u2013360.","journal-title":"J. Franklin Institute"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(91)90068-D","volume":"87","author":"F. G\u00f6bel","year":"1991","unstructured":"F. G\u00f6bel, J.O. Cerdeira, and H.J. Veldman, Label-connected graphs and the gossip problem, Discrete Mathematics 87 (1991) 9\u201340.","journal-title":"Discrete Mathematics"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319\u2013349.","journal-title":"Networks"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(80)90116-8","volume":"30","author":"D.J. Kleitman","year":"1980","unstructured":"D.J. Kleitman and J.B. Shearer, Further gossip problems, Discrete Mathematics 30 (1980) 151\u2013156.","journal-title":"Discrete Mathematics"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","volume":"21","author":"D.W. Krumme","year":"1992","unstructured":"D.W. Krumme, K.N. Venkataraman, and G. Cybenko. Gossiping in minimal time, SIAM J. Computing 21 (1992) 111\u2013139.","journal-title":"SIAM J. Computing"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"D. Krumme, Reordered gossip schemes, submitted to Discrete Mathematics.","DOI":"10.1016\/0012-365X(94)00302-Y"},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(93)90509-R","volume":"113","author":"R. Labahn","year":"1993","unstructured":"R. Labahn, Information flows on hypergraphs, Discrete Mathematics 113 (1993) 71\u201397.","journal-title":"Discrete Mathematics"},{"key":"21_CR11","volume-title":"Technical Reports 92774 (Part I) and 92785 (Part II)","author":"R. Labahn","year":"1992","unstructured":"R. Labahn, Kernels of minimum size gossip schemes, to appear in Discrete Mathematics. Also Technical Reports 92774 (Part I) and 92785 (Part II), Forschungsinstitut f\u00fcr Diskrete Mathematik, Rheinische Friedrich-Wilhelms-Universit\u00e4t, Nassestr 2, D-5300 Bonn, Germany, 1992."},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(82)90153-4","volume":"39","author":"D. West","year":"1982","unstructured":"D. West, A class of solutions to the gossip problem, Part I, Discrete Mathematics 39 (1982) 307\u2013326.","journal-title":"Discrete Mathematics"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0220027","volume":"20","author":"O. Wolfson","year":"1991","unstructured":"O. Wolfson and A. Segall, The communication complexity of atomic commitment and of gossiping, SIAM J. Computing 20 (1991) 423\u2013450.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Computing Theory and Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58078-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:10:46Z","timestamp":1619572246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58078-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580782","9783540484356"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58078-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}