{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:26:27Z","timestamp":1648855587116},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0167-8191(02)00075-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"627-647","source":"Crossref","is-referenced-by-count":3,"title":["Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing"],"prefix":"10.1016","volume":"28","author":[{"given":"Petr","family":"Salinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Tvrd\u0131\u0301k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00075-3_BIB1","series-title":"CONPAR 92\u2013VAPP V","first-page":"843","article-title":"An algorithm of broadcasting in the mesh of trees","volume":"vol. 634","author":"Barth","year":"1992"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB2","series-title":"Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures","first-page":"318","article-title":"On the number of rounds necessary to disseminate information","author":"Even","year":"1989"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","article-title":"Minimum-time broadcast networks","volume":"10","author":"Farley","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB4","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 Applied Mathematics"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0167-8191(02)00075-3_BIB7","first-page":"295","article-title":"Dissemination of information in vertex-disjoint paths mode","volume":"15","author":"Hromkovi\u010d","year":"1996","journal-title":"Computers and Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0167-8191(02)00075-3_BIB8","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":"Information and Computation"},{"issue":"1","key":"10.1016\/S0167-8191(02)00075-3_BIB9","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":"133","author":"Hromkovi\u010d","year":"1997","journal-title":"Information and Computation"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB10","series-title":"Combinatorial Network Theory","first-page":"152","article-title":"Dissemination of information in interconnection networks (broadcasting and gossiping)","author":"Hromkovi\u010d","year":"1996"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(97)00112-1","article-title":"The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width","volume":"83","author":"Klasing","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB12","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 Mathematics"},{"issue":"1","key":"10.1016\/S0167-8191(02)00075-3_BIB13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1137\/0221010","article-title":"Gossiping in minimal time","volume":"21","author":"Krumme","year":"1992","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB14","series-title":"Euro-Par'96 Parallel Processing","first-page":"333","article-title":"Gossip in trees under line-communication mode","volume":"vol. 1123","author":"Laforest","year":"1996"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB15","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"issue":"12","key":"10.1016\/S0167-8191(02)00075-3_BIB16","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/2.476198","article-title":"Collective communication in wormhole-routed massively parallel computers","volume":"28","author":"McKinley","year":"1995","journal-title":"Computer"},{"issue":"12","key":"10.1016\/S0167-8191(02)00075-3_BIB17","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1109\/71.334899","article-title":"Unicast-based multicast communication in wormhole-routed networks","volume":"5","author":"McKinley","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB18","series-title":"Communications dans les r\u00e9seaux de processeurs","author":"Rumeur","year":"1994"},{"key":"10.1016\/S0167-8191(02)00075-3_BIB19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(93)90180-V","article-title":"Fast information sharing in a complete network","volume":"42","author":"Sunderam","year":"1993","journal-title":"Discrete Applied Mathematics"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:54:00Z","timestamp":1556729640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102000753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0167819102000753"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00075-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}