乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T05:28:15Z","timestamp":1700198895680},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1006\/inco.1996.2618","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T18:14:15Z","timestamp":1034014455000},"page":"1-33","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes"],"prefix":"10.1006","volume":"133","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[]},{"given":"Hubert","family":"Wagener","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/inco.1996.2618_IC962618RF1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(90)90160-Y","article-title":"Parallel algorithms for gossiping by mail","volume":"34","author":"Bagchi","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1006\/inco.1996.2618_IC962618RF2","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/jagm.1993.1013","article-title":"Edge separators of planar and outerplanar graphs with applications","volume":"14","author":"Diks","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1006\/inco.1996.2618_IC962618RF3","doi-asserted-by":"crossref","unstructured":"S. Even, B. Monien, 1989, On the number of rounds necessary to disseminate information, Proc. 1st ACM Symp. on Parallel Algorithms and Architectures (SPAA'89)","DOI":"10.1145\/72935.72969"},{"key":"10.1006\/inco.1996.2618_IC962618RF4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0016-0032(79)90004-8","article-title":"Gossips and telegraphs","volume":"307","author":"Entringer","year":"1979","journal-title":"J. Franklin Inst."},{"key":"10.1006\/inco.1996.2618_IC962618RF5","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"},{"key":"10.1006\/inco.1996.2618_IC962618RF6","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."},{"key":"10.1006\/inco.1996.2618_IC962618RF7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BF01908630","article-title":"Optimal algorithms for dissemination of information in some interconnection networks","volume":"10","author":"Hromkovi\u010d","year":"1993","journal-title":"Algorithmica"},{"key":"10.1006\/inco.1996.2618_IC962618RF8","series-title":"Combinatorial Network Theory","article-title":"Dissemination of information in interconnection networks (broadcasting and gossiping)","author":"Hromkovi\u010d","year":"1995"},{"key":"10.1006\/inco.1996.2618_IC962618RF9","first-page":"295","article-title":"Dissemination of information in vertex\u2013disjoint paths mode","volume":"15","author":"Hromkovi\u010d","year":"1996","journal-title":"Comput. Artificial Intell."},{"key":"10.1006\/inco.1996.2618_IC962618RF10","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."},{"key":"10.1006\/inco.1996.2618_IC962618RF11","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 J. Comput."},{"key":"10.1006\/inco.1996.2618_IC962618RF12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0166-218X(94)90184-8","article-title":"Broadcasting in butterfly and DeBruijn networks","volume":"53","author":"Klasing","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1006\/inco.1996.2618_IC962618RF13","doi-asserted-by":"crossref","unstructured":"J. Kahn, G. Kalai, N. Linial, 1988, The influence of variables on boolean functions (extended abstract), Proc. 29th IEEE Symp. on Foundations of Computer Science (FOCS '88)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"10.1006\/inco.1996.2618_IC962618RF14","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.1006\/inco.1996.2618_IC962618RF15","series-title":"Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes","author":"Leighton","year":"1992"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540196926188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540196926188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T20:47:15Z","timestamp":1576615635000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540196926188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0890540196926188"],"URL":"https:\/\/doi.org\/10.1006\/inco.1996.2618","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}