{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:09Z","timestamp":1725551649085},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_17","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"143-152","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal fault-tolerant broadcasting in trees"],"prefix":"10.1007","author":[{"given":"Petri\u00a7or","family":"Panaite","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0607002","volume":"7","author":"K.A. Berman","year":"1986","unstructured":"K.A. Berman and M. Hawrylycz, Telephone problems with failures, SIAM J. Alg. Disc. Meth. 7 (1986), 13\u201317.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(88)90037-6","volume":"20","author":"D. Bienstock","year":"1988","unstructured":"D. Bienstock, Broadcasting with random faults, Disc. Appl. Math. 20 (1988), 1\u20137.","journal-title":"Disc. Appl. Math."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, K. Diks and A. PeIc, Sparse networks supporting efficient reliable broadcasting, Proc. ICALP'93, LNCS 700, 388-397.","DOI":"10.1007\/3-540-56939-1_88"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0405025","volume":"5","author":"K. Diks","year":"1992","unstructured":"K. Diks and A. Pelc, Almost safe gossiping in bounded degree networks, SIAM J. Disc. Math. 5 (1992), 338\u2013344.","journal-title":"SIAM J. Disc. Math."},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0409002","volume":"9","author":"K. Diks","year":"1996","unstructured":"K. Diks and A. Pelc, Efficient gossiping by packets in networks with random faults, SIAM J. Disc. Math. 9 (1996), 7\u201318.","journal-title":"SIAM J. Disc. Math."},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Disc. Appl. Math. 53 (1994), 79\u2013133.","journal-title":"Disc. Appl. Math."},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/net.3230220505","volume":"22","author":"L. Gargano","year":"1992","unstructured":"L. Gargano, Tighter bounds on fault-tolerant broadcasting and gossiping, Networks 22 (1992), 469\u2013486.","journal-title":"Networks"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0405015","volume":"5","author":"L. Gargano","year":"1992","unstructured":"L. Gargano and U. Vaccaro, Minimum time networks tolerating a logarithmic number of faults, SIAM J. Disc. Math. 5 (1992), 178\u2013198.","journal-title":"SIAM J. Disc. Math."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0608036","volume":"8","author":"R.W. Haddad","year":"1987","unstructured":"R.W. Haddad, S. Roy and A.A. Schiffer, On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth. 8 (1987), 439\u2013445.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"17_CR10","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":"17_CR11","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien and R. Peine, Dissemination of information in interconnection networks (broadcasting and gossiping), in: F. Hsu and D.-Z. Du (Eds.), Combinatorial Network Theory, Kluwer Academic Publishers 1996, 125\u2013212.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230150203","volume":"15","author":"A.L. Liestman","year":"1985","unstructured":"A.L. Liestman, Fault-tolerant broadcast graphs, Networks 15 (1985), 159\u2013171.","journal-title":"Networks"},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","volume":"28","author":"A. Pelc","year":"1996","unstructured":"A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996), 143\u2013156.","journal-title":"Networks"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1002\/net.3230190706","volume":"19","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and A.A. Schiffer, Time bounds on fault-tolerant broadcasting, Networks 19 (1989), 803\u2013822.","journal-title":"Networks"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0166-218X(89)90007-3","volume":"25","author":"E.R. Scheinerman","year":"1989","unstructured":"E.R. Scheinerman and J.C. Wierman, Optimal and near-optimal broadcast in random graphs, Disc. Appl. Math. 25 (1989), 289\u2013297.","journal-title":"Disc. Appl. Math."},{"key":"17_CR16","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"P.J. Slater","year":"1981","unstructured":"P.J. Slater, E.J. Cockayne and S.T. Hedetniemi, Information dissemination in trees, SIAM J. Comput. 10 (1981), 692\u2013701.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:16:45Z","timestamp":1578536205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_17"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"29 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}