{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:28Z","timestamp":1725664048490},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"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-57899-4_60","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:40:50Z","timestamp":1330245650000},"page":"288-300","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Gossiping in vertex-disjoint paths mode in interconnection networks"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Elena A.","family":"St\u00f6hr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"S. Even, B. Monien, \u201cOn the number of rounds necessary to disseminate information\u201d, Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, Santa Fe, June 1989, pp. 318\u2013327.","DOI":"10.1145\/72935.72969"},{"key":"25_CR2","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, P.J. Slater, \u201cGossips and telegraphs\u201d, J. Franklin Institute 307 (1979), pp. 353\u2013360.","journal-title":"J. Franklin Institute"},{"key":"25_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, Vol. 10 (1980), pp. 59\u201370.","journal-title":"Networks"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"R. Feldmann, J. Hromkovi\u010d, S. Madhavapeddy, B. Monien, P. Mysliwietz, \u201cOptimal algorithms for dissemination of information in generalized communication modes\u201d, Proc. PARLE'92, Lecture Notes in Computer Science 605, Springer Verlag 1992, pp. 115\u2013130.","DOI":"10.1007\/3-540-55599-4_84"},{"key":"25_CR5","unstructured":"P. Fraigniaud, E. Lazard, \u201dMethods and problems of communication in usual networks\u201d, Technical Report, Universit\u00e9 de ParisSud, 1991, submitted to Discrete Applied Mathematics, special issue on \u201d Broadcasting and Gossiping\u201d."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"R. Feldmann, P. Mysliwietz, \u201dThe Shuffle Exchange Network has a Hamiltonian Path\u201d, Proc. of 17th Math. Foundations of Computer Science (MFCS'92), Springer LNCS 629, pp. 246\u2013254.","DOI":"10.1007\/3-540-55808-X_23"},{"issue":"No.1","key":"25_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1142\/S0129626492000131","volume":"2","author":"R. Feldmann","year":"1992","unstructured":"R. Feldmann, W. Unger, \u201dThe Cube-Connected Cycles Network is a Subgraph of the Butterfly Network\u201d, Parallel Processing Letters, Vol. 2, No. 1 (1992), pp. 13\u201319.","journal-title":"Parallel Processing Letters"},{"key":"25_CR8","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, A.L. Liestman, \u201dA survey of gossiping and broadcasting in communication networks\u201d, Networks, Vol. 18, pp. 319\u2013349, 1988.","journal-title":"Networks"},{"key":"25_CR9","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":"25_CR10","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, \u201dDissemination 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":"25_CR11","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/0016-0032(74)90126-4","volume":"297","author":"F. Harary","year":"1974","unstructured":"F. Harary, A.J. Schwenk, \u201dThe communication problem on graphs and digraphs\u201d, J, Franklin Institute 297 (1974), pp. 491\u2013495.","journal-title":"J, Franklin Institute"},{"key":"25_CR12","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":"25_CR13","doi-asserted-by":"crossref","unstructured":"R. Klasing, B. Monien, R. Peine, E. Stohr, \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":"25_CR14","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":"25_CR15","unstructured":"F.T. Leighton, \u201cIntroduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes\u201d, Morgan Kaufmann Publishers (1991)."},{"key":"25_CR16","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-642-46908-4_52","volume-title":"Topics in Combinatorics and Graph Theory","author":"R. Labahn","year":"1990","unstructured":"R. Labahn, I. Warnke, \u201dQuick gossiping by multi-telegraphs\u201d, In R. Bodendiek, R. Henn (Eds.), Topics in Combinatorics and Graph Theory, pp. 451\u2013458, Physica-Verlag Heidelberg, 1990."},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","volume":"7","author":"B. Monien","year":"1990","unstructured":"B. Monien, I.H. Sudborough, \u201dEmbedding one Interconnection Network in Another\u201d, Computing Suppl. 7, pp. 257\u2013282, 1990.","journal-title":"Computing Suppl."},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(93)90180-V","volume":"42","author":"V. S. Sunderam","year":"1993","unstructured":"V.S. Sunderam, P. Winkler, \u201dFast information sharing in a complete network\u201d, Discrete Applied Mathematics 42 (1993), pp. 75\u201386.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:16:02Z","timestamp":1578507362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_60"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_60","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":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}