{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:36Z","timestamp":1725552156020},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_27","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"307-318","source":"Crossref","is-referenced-by-count":3,"title":["On Randomized Broadcasting in Star Graphs"],"prefix":"10.1007","author":[{"given":"Robert","family":"Els\u00e4sser","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Akers, S., Harel, D., Krishnamurthy, B.: The star graph: An attractive alternative to the n-cube. In: Proc. of the International Conference on Parallel Processing (ICPP), pp. 393\u2013400 (1987)"},{"key":"27_CR2","unstructured":"Akers, S., Krishnamurthy, B.: A group-theoretic model for symmetric innterconnection networks. In: Proc. of the International Conference on Parallel Processing (ICCP), pp. 555\u2013565 (1986)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chen, C., Chen, J.: Vertex-disjoint routings in Star graphs. In: Proc. of the first IEEE Int\u2019l Conf. Algorithms and Architectures in Parallel Processing, pp. 460\u2013464 (1995)","DOI":"10.1109\/ICAPP.1995.472218"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/71.640011","volume":"8","author":"C. Chen","year":"1997","unstructured":"Chen, C., Chen, J.: Nearly optimal one-to-many parallel routing in Star networks. IEEE Transactions on Parallel and Distributed Systems\u00a08, 1196\u20131202 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"27_CR5","unstructured":"Chen, H.: Threshold of broadcast in random graphs. DIMACS Technical Report 97-12 (1997)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat.\u00a023, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems\u00a05 (1994)","DOI":"10.1109\/71.262586"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. of the 6th ACM Symposium on Principles of Distributed Computing, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Madhavapeddy, S., Sudborough, I.: Three disjoint path paradigms in Star networks. In: Proc. of the 3rd IEEE Symp. Parallel and Distributed Processing, pp. 400\u2013406 (1991)","DOI":"10.1109\/SPDP.1991.218213"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"I","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures and Algorithm\u00a0I(4), 447\u2013460 (1990)","journal-title":"Random Structures and Algorithm"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.485370","volume":"45","author":"P. Fragopoulou","year":"1996","unstructured":"Fragopoulou, P., Akl, S.: Edge-disjoint spanning trees on the Star network with applications to fault tolerance. IEEE Trans. Computers\u00a045, 174\u2013185 (1996)","journal-title":"IEEE Trans. Computers"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0166-218X(94)00033-6","volume":"54","author":"A. Frieze","year":"1994","unstructured":"Frieze, A., Molloy, M.: Broadcasting in random graphs. Discrete Applied Mathematics\u00a054, 77\u201379 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"27_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"36","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of chernoff bounds. Information Processing Letters\u00a036(6), 305\u2013308 (1990)","journal-title":"Information Processing Letters"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L. Harper","year":"1964","unstructured":"Harper, L.: Optimal assignment of numbers to vertices. J. Soc. Ind. Appl. Math.\u00a012, 131\u2013135 (1964)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"27_CR15","unstructured":"Jwo, J., Lakshmivarahan, S., Dhall, S.: Characterization of node disjoint (parallel) path in Star graphs. In: Proc. of the 5th Intl. Parallel Processing Symp., pp. 404\u2013409 (1991)"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Karp, R., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proc. of FOCS 2000, pp. 565\u2013574 (2000)","DOI":"10.1109\/SFCS.2000.892324"},{"key":"27_CR17","unstructured":"Nigam, M., Sahni, S., Yeh, N.: Embedding hamiltonians and hypercubes in Star interconnection graphs. In: Proc. of the Intl. Conf. on Parallel Processing, vol.\u00a0III, pp. 340\u2013342 (1990)"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/jpdc.1993.1098","volume":"19","author":"S. Ranka","year":"1993","unstructured":"Ranka, S., Wang, J.-C., Yeh, N.: Embedding meshes on the Star graph. Journal of Parallel and Distributed Computing\u00a019, 131\u2013135 (1993)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/12.485370","volume":"45","author":"J. Sheu","year":"1996","unstructured":"Sheu, J., Wu, C., Chen, T.: An optimal broadcasting algorithm without message redundancy in Star graphs. IEEE Trans. Computers\u00a045, 174\u2013185 (1996)","journal-title":"IEEE Trans. Computers"}],"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\/11604686_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:24Z","timestamp":1619507064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11604686_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}