{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T01:55:47Z","timestamp":1697939747585},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf01788111","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T11:37:00Z","timestamp":1119181020000},"page":"363-381","source":"Crossref","is-referenced-by-count":13,"title":["Quick gossiping without duplicate transmissions"],"prefix":"10.1007","volume":"2","author":[{"given":"\u00c1kos","family":"Seress","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01788111_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(72)90001-5","volume":"2","author":"B. Baker","year":"1972","unstructured":"Baker, B., Shostak, R.: Gossips and telephones. Discrete Math.2, 191\u2013193 (1972)","journal-title":"Discrete Math."},{"key":"BF01788111_CR2","volume-title":"Problemes Comb. et Theory des Graphs","author":"J.-C. Bermond","year":"1976","unstructured":"Bermond, J.-C.: Le problem des \u201couvoirs\u201d (hypergraph gossip problem). In: Problemes Comb. et Theory des Graphs, edited by J.-C. Bermond. Paris: C.N.R.S. Colloq. 1976"},{"key":"BF01788111_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0602002","volume":"2","author":"R. Bumby","year":"1981","unstructured":"Bumby, R.: A problem with telephones. SIAM J. Algebraic Discrete Methods2, 13\u201318 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF01788111_CR4","unstructured":"Golumbic, M.: The general gossip problem. IBM Research Report (1974)"},{"key":"BF01788111_CR5","doi-asserted-by":"crossref","first-page":"447","DOI":"10.4153\/CMB-1972-081-0","volume":"15","author":"A. Hajnal","year":"1972","unstructured":"Hajnal, A., Milner, E., Szemer\u00e9di, E.: A cure for the telephone disease. Canad. Math. Bull.15, 447\u2013450 (1972)","journal-title":"Canad. Math. Bull."},{"key":"BF01788111_CR6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/0016-0032(74)90126-4","volume":"297","author":"F. Harary","year":"1974","unstructured":"Harary, F., Schwenk, A.: The communication problem on graphs and digraphs. J. Franklin Inst.297, 491\u2013495 (1974)","journal-title":"J. Franklin Inst."},{"key":"BF01788111_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(80)90116-8","volume":"30","author":"D. Kleitman","year":"1980","unstructured":"Kleitman, D., Shearer, J.: Further gossip problems. Discrete Math.30, 151\u2013156 (1980)","journal-title":"Discrete Math."},{"key":"BF01788111_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/sapm1973524345","volume":"52","author":"K. Lebensold","year":"1973","unstructured":"Lebensold, K.: Efficient communication by phone calls. Stud. Appl. Math.52, 345\u2013358 (1973)","journal-title":"Stud. Appl. Math."},{"key":"BF01788111_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(83)90272-8","volume":"46","author":"\u00c1. Seress","year":"1983","unstructured":"Seress, \u00c1.: Gossiping old ladies. Discrete Math.46, 75\u201381 (1983)","journal-title":"Discrete Math."},{"key":"BF01788111_CR10","unstructured":"Seress, \u00c1.: Gossips by conference calls. Stud. Sci. Math. Hung.20, (1985)"},{"key":"BF01788111_CR11","first-page":"188","volume":"19","author":"R. Tijdeman","year":"1971","unstructured":"Tijdeman, R.: On a telephone problem. Nieuw Arch. Wiskd.19, 188\u2013192 (1971)","journal-title":"Nieuw Arch. Wiskd."},{"key":"BF01788111_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(82)90153-4","volume":"39","author":"D. West","year":"1982","unstructured":"West, D.: A class of solutions to the gossip problem, part I. Discrete Math.39, 307\u2013326 (1982)","journal-title":"Discrete Math."},{"key":"BF01788111_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0012-365X(82)90128-5","volume":"40","author":"D. West","year":"1982","unstructured":"West, D.: A class of solutions to the gossip problem, part III. Discrete Math.40, 285\u2013310 (1982)","journal-title":"Discrete Math."},{"key":"BF01788111_CR14","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0603042","volume":"3","author":"D. West","year":"1982","unstructured":"West, D.: Gossiping without duplicate transmissions. SIAM Algebraic Discrete Methods3, 418\u2013419 (1982)","journal-title":"SIAM Algebraic Discrete Methods"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788111.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788111\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:12:23Z","timestamp":1557493943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01788111"],"URL":"https:\/\/doi.org\/10.1007\/bf01788111","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}