{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:57Z","timestamp":1725664077660},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582182"},{"type":"electronic","value":"9783540485773"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994]]},"DOI":"10.1007\/3-540-58218-5_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:36:33Z","timestamp":1330270593000},"page":"219-230","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimal algorithms for broadcast and gossip in the edge-disjoint path modes"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubert","family":"Wagener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"14","author":"K. Diks","year":"1993","unstructured":"K. Diks, H.N. Djidjev, O. S\u00fdkora, I. Vr\u0165o, \u201dEdge separators of planar and outerplanar graphs with applications\u201d, Journal of Algorithms 14 (1993), pp. 258\u2013279.","journal-title":"Journal of Algorithms"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"S. Even, B. Monien, \u201dOn the number of rounds necessary to disseminate information\u201d, Proc. 1st ACM Symp. on Parallel Algorithms and Architectures (SPAA'89), 1989, pp. 318\u2013327.","DOI":"10.1145\/72935.72969"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","volume":"10","author":"A. M. Farley","year":"1980","unstructured":"A.M. Farley, \u201cMinimum-Time Line Broadcast Networks\u201d, Networks 10 (1980), pp. 59\u201370.","journal-title":"Networks"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, P. Mysliwietz, \u201dOptimal algorithms for dissemination of information in generalized communication modes\u201d, Proc. Parallel Architectures and Languages Europe (PARLE'92), Lecture Notes in Computer Science 605, Springer Verlag 1992, pp. 115\u2013130.","DOI":"10.1007\/3-540-55599-4_84"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, C. D. Jeschke, B. Monien, \u201dOptimal algorithms for dissemination of information in some interconnection networks (extended abstract)\u201d, Proc. MFCS'90, Lecture Notes in Computer Science 452, Springer Verlag 1990, pp. 337\u2013346.","DOI":"10.1007\/BFb0029627"},{"key":"20_CR6","volume-title":"Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping)","author":"J. Hromkovi\u010d","year":"1993","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, R. Peine, \u201cDissemination of Information in Interconnection Networks (Broadcasting and Gossiping)\u201d, manuscript, University of Paderborn, Germany, Feb. 1993, to appear as a book chapter in: F. Hsu, D.-Z. Du (Eds.), Combinatorial Network Theory, Science Press & AMS, 1994."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, E.A. St\u00f6hr, \u201dGossiping in vertex-disjoint paths mode in interconnection networks\u201d, Proc. 19th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG '93), Lecture Notes in Computer Science, Springer Verlag 1993, to appear.","DOI":"10.1007\/3-540-57899-4_60"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, E.A. St\u00f6hr, H. Wagener, \u201dGossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs\u201d, Proc. of the First Annual European Symposium on Algorithms (ESA '93), Lecture Notes in Computer Science 726, Springer Verlag 1993, pp. 200\u2013211.","DOI":"10.1007\/3-540-57273-2_56"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","volume":"21","author":"D. W. Krumme","year":"1992","unstructured":"D.W. Krumme, G. Cybenko, K.N. Venkataraman, \u201dGossiping in minimal time\u201d, SIAM J. Comput. 21 (1992), pp. 111\u2013139.","journal-title":"SIAM J. Comput."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"R. Klasing, B. Monien, R. Peine, E. St\u00f6hr, \u201dBroadcasting in Butterfly and DeBruijn networks\u201d, Proc. STACS'92, Lecture Notes in Computer Science 577, Springer Verlag 1992, pp. 351\u2013362.","DOI":"10.1007\/3-540-55210-3_196"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W. Kn\u00f6del","year":"1975","unstructured":"W. Kn\u00f6del, \u201dNew gossips and telephones\u201d, Discrete Math. 13 (1975), p. 95.","journal-title":"Discrete Math."},{"key":"20_CR12","unstructured":"F.T. Leighton, \u201cIntroduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes\u201d, Morgan Kaufmann Publishers (1992)."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT '94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58218-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:02:41Z","timestamp":1578535361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58218-5_20"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582182","9783540485773"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58218-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"30 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}