{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:43:35Z","timestamp":1758267815231},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00112-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:12:16Z","timestamp":1027599136000},"page":"229-246","source":"Crossref","is-referenced-by-count":13,"title":["The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width"],"prefix":"10.1016","volume":"83","author":[{"given":"Ralf","family":"Klasing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00112-1_BIB1","series-title":"Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures (SPAA '89)","first-page":"318","article-title":"On the number of rounds necessary to disseminate information","author":"Even","year":"1989"},{"key":"10.1016\/S0166-218X(97)00112-1_BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","article-title":"Minimum-time line broadcast networks","volume":"10","author":"Farley","year":"1980","journal-title":"Networks"},{"issue":"1\u20133","key":"10.1016\/S0166-218X(97)00112-1_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(94)90179-1","article-title":"Optimal algorithms for dissemination of information in generalized communication modes","volume":"53","author":"Feldmann","year":"1994","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/S0166-218X(97)00112-1_BIB4","first-page":"295","article-title":"Dissemination of information in vertex-disjoint paths mode","volume":"15","author":"Hromkovi\u010d","year":"1996","journal-title":"Comput. Artif. Intell."},{"issue":"1","key":"10.1016\/S0166-218X(97)00112-1_BIB5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1006\/inco.1995.1154","article-title":"Gossiping in vertex-disjoint paths mode in d-dimensional grids and planar graphs","volume":"123","author":"Hromkovi\u010d","year":"1995","journal-title":"Inform. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(97)00112-1_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2618","article-title":"Optimal algorithms for broadcast and gossip in the edge-disjoint path modes","volume":"131","author":"Hromkovi\u010d","year":"1997","journal-title":"Inform. Comput."},{"key":"10.1016\/S0166-218X(97)00112-1_BIB7","series-title":"Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (FOCS '88)","first-page":"68","article-title":"The influence of variables on boolean functions","author":"Kahn","year":"1988"},{"issue":"1","key":"10.1016\/S0166-218X(97)00112-1_BIB8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","article-title":"New gossips and telephones","volume":"13","author":"Kn\u00f6del","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00112-1_BIB9","article-title":"Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes","author":"Leighton","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001121?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001121?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:27:09Z","timestamp":1556666829000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001121"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00112-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}