{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:01:08Z","timestamp":1743116468163,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651956"},{"type":"electronic","value":"9783540494942"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/10692760_4","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T12:35:37Z","timestamp":1277901337000},"page":"38-49","source":"Crossref","is-referenced-by-count":0,"title":["Communication in the Two-Way Listen-in Vertex-Disjoint Paths Mode"],"prefix":"10.1007","author":[{"given":"Hans-Joachim","family":"B\u00f6ckenhauer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9967-7","volume-title":"Graph Theory","author":"B. Bollobas","year":"1979","unstructured":"Bollobas, B.: Graph Theory. Springer, New York (1979)"},{"key":"4_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"4_CR3","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.: Graph Algorithms. Pitman, London (1979)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"5970","DOI":"10.1002\/net.3230100106","volume":"10","author":"A.M. Farley","year":"1980","unstructured":"Farley, A.M.: Minimum-Time Line Broadcast Networks. Networks\u00a010, 5970 (1980)","journal-title":"Networks"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Feldmann, R., Hromkovi\u010d, J., Madhavapeddy, S., Monien, B., Mysliwietz, P.: Optimal Algorithms for Dissemination of Information in Generalized Communication Modes. Discrete Applied Mathematics\u00a053(1-3), 55\u201378 (1994)","DOI":"10.1016\/0166-218X(94)90179-1"},{"issue":"1-3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Mathematics\u00a053(1-3), 79\u2013133 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BF01184811","volume":"29","author":"R. Feldmann","year":"1996","unstructured":"Feldmann, R., Mysliwietz, P.: The Shuffle Exchange Network has a Hamiltonian Path. Mathematical Systems Theory\u00a029(5), 471\u2013485 (1996)","journal-title":"Mathematical Systems Theory"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks\u00a018, 319\u2013349 (1988)","journal-title":"Networks"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Klasing, R., Monien, B., Peine, R.: Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping). In: Du, D.-Z., Hsu, F. (eds.) Combinatorial Network Theory, pp. 125\u2013212. Kluwer Academic Publishers, Dordrecht (1995)","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"4_CR10","unstructured":"Hromkovi\u010d, J., Klasing, R., St\u00f6hr, E.A.: Dissemination of Information in Vertex-Disjoint Paths Mode. Computers and Artificial Intelligence\u00a015(4), 295\u2013318 (1996)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Klasing, R., St\u00f6hr, E.A., Wagener, H.: Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Information and Computation\u00a0123(1), 17\u201328 (1995)","DOI":"10.1006\/inco.1995.1154"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Klasing, R., Unger, W., Wagener, H.: Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Information and Computation\u00a0133(1), 1\u201333 (1997)","DOI":"10.1006\/inco.1996.2618"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d, J., Lory\u015b, K., Kanarek, P., Klasing, R., Unger, W., Wagener, H.: On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hy-percube Algorithms on Bounded-Degree Networks. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 255\u2013266. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-59042-0_78"},{"key":"4_CR14","volume-title":"On the Complexity of Broadcast and Gossip in Different Communication Modes (Dissertation)","author":"R. Klasing","year":"1996","unstructured":"Klasing, R.: On the Complexity of Broadcast and Gossip in Different Communication Modes (Dissertation). Shaker Verlag, Aachen (1996)"},{"issue":"1-3","key":"4_CR15","first-page":"227","volume":"82","author":"R. Klasing","year":"1998","unstructured":"Klasing, R.: The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width. Discrete Applied Mathematics\u00a082(1-3), 227\u2013244 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR16","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Francisco (1992)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/10692760_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:37:47Z","timestamp":1578519467000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/link.springer.com\/10.1007\/10692760_4"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651956","9783540494942"],"references-count":16,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/10692760_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}