{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:28Z","timestamp":1725663628114},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:47:46Z","timestamp":1330249666000},"page":"226-229","source":"Crossref","is-referenced-by-count":0,"title":["On the broadcast time of the butterfly network"],"prefix":"10.1007","author":[{"given":"Elena","family":"St\u00f6hr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"23_CR1","unstructured":"S.B. Akers, B. Krishnamurthy (1986), A group-theoretic model for symmetric interconnection networks parallel processing, International Conference Parallel Processing, pp.216\u2013233."},{"issue":"N3","key":"23_CR2","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/0219037","volume":"19","author":"F. Annexstein","year":"1990","unstructured":"F. Annexstein, M. Baumslag, A.L. Rosenberg (1990), Group action graphs and parallel architectures, Siam. J. Comput. 19, N 3, pp.544\u2013569.","journal-title":"Siam. J. Comput."},{"key":"23_CR3","unstructured":"J.-C. Bermond, P. Hell, A.L. Liestman, J.G. Peters (1988), Broadcasting in bounded degree graphs, to app. in SIAM J. Discr. Math."},{"key":"23_CR4","unstructured":"J.-C. Bermond, C. Peyrat (1988), Broadcasting in deBruijn networks, in Proc. Nineteenth SE Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium, pp. 283\u2013292."},{"key":"23_CR5","unstructured":"A. Farley, S. Hedetniemi, S. Mitchell, A. Proskurowski (1979), Minimum broadcast graphs, Discrete Math. 25, pp. 189\u2013193."},{"key":"23_CR6","first-page":"337","volume":"452","author":"J. Hromkovic","year":"1990","unstructured":"J. Hromkovic, C.D. Jeschke, B. Monien (1990), Optimal algorithms for dissemination of information in some interconnection networks, Proc. MFCS'90, LNCS 452, pp 337\u2013346.","journal-title":"Proc. MFCS'90, LNCS"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/0401049","volume":"1","author":"A.L. Liestman","year":"1988","unstructured":"A.L. Liestman, J.G. Peters (1988), Broadcast networks of bounded degree, Siam. J. Discr. Math. 1, pp. 531\u2013540.","journal-title":"Siam. J. Discr. Math."},{"key":"23_CR8","unstructured":"E.A. St\u00f6hr (1990), Broadcasting in the Butterfly network, IPL, to app."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55121-2_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:28:02Z","timestamp":1619573282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}