{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:42Z","timestamp":1725869502413},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_11","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"144-158","source":"Crossref","is-referenced-by-count":1,"title":["Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model"],"prefix":"10.1007","author":[{"given":"Petr","family":"Gregor","sequence":"first","affiliation":[]},{"given":"Riste","family":"\u0160krekovski","sequence":"additional","affiliation":[]},{"given":"Vida","family":"Vuka\u0161inovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(99)00155-9","volume":"100","author":"A Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Kionis, S., Schieber, B.: Optimal multiple message broadcasting in telephone-like communication systems. Discrete Appl. Math. 100, 1\u201315 (2000)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Bruck, J., Cypher, R., Ho, C.T.: Multiple message broadcasting with generalized Fibonacci trees. In: Proceedings of the 4th Symposium on Parallel and Distributed Processing, pp. 424\u2013431 (1992)","key":"11_CR2","DOI":"10.1109\/SPDP.1992.242714"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.dam.2014.03.014","volume":"173","author":"F-H Chang","year":"2014","unstructured":"Chang, F.-H., Chen, Y.-M., Chia, M.-L., Kuo, D., Yu, M.-F.: All-to-all broadcast problem of some classes of graphs under the half duplex all-port model. Discrete Appl. Math. 173, 28\u201334 (2014)","journal-title":"Discrete Appl. Math."},{"key":"11_CR4","first-page":"276","volume":"137","author":"G Fertin","year":"2013","unstructured":"Fertin, G., Raspaud, A.: A survey on Kn\u00f6del graphs. Discrete Appl. Math. 137, 276\u2013289 (2013)","journal-title":"Discrete Appl. Math."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0139032","volume":"39","author":"A Farley","year":"1980","unstructured":"Farley, A.: Broadcast time in communication networks. SIAM J. Appl. Math. 39, 385\u2013390 (1980)","journal-title":"SIAM J. Appl. Math."},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.amc.2015.05.059","volume":"266","author":"P Gregor","year":"2015","unstructured":"Gregor, P., \u0160krekovski, R., Vuka\u0161inovi\u0107, V.: Rooted level-disjoint partitions of Cartesian products. Appl. Math. Comput. 266, 244\u2013258 (2015)","journal-title":"Appl. Math. Comput."},{"unstructured":"Gregor, P., \u0160krekovski, R., Vuka\u0161inovi\u0107, V.: Modelling simultaneous broadcasting by level-disjoint partitions. Preprint arXiv:1609.01116","key":"11_CR7"},{"unstructured":"Grigoryan, H.: Problems related to broadcasting in graphs. Ph.D. thesis, Concordia University, Montreal, Quebec, Canada (2013)","key":"11_CR8"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2014.02.005","volume":"171","author":"H Grigoryan","year":"2014","unstructured":"Grigoryan, H., Harutyunyan, H.A.: Diametral broadcast graphs. Discrete Appl. Math. 171, 53\u201359 (2014)","journal-title":"Discrete Appl. Math."},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1002\/net.20110","volume":"47","author":"HA Harutyunyan","year":"2006","unstructured":"Harutyunyan, H.A.: Minimum multiple message broadcast graphs. Networks 47, 218\u2013224 (2006)","journal-title":"Networks"},{"unstructured":"Harutyunyan, H.A.: Multiple message broadcasting in modified Kn\u00f6del graphs. In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity, pp. 157\u2013165 (2000)","key":"11_CR11"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18, 319\u2013349 (1988)","journal-title":"Networks"},{"key":"11_CR13","series-title":"Applied Optimization","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-1-4757-2491-2_5","volume-title":"Combinatorial Network Theory","author":"J Hromkovi\u010d","year":"1996","unstructured":"Hromkovi\u010d, J., Klasing, R., Monien, B., Piene, R., Du, D.-Z., Hsu, D.F.: Dissemination of information in communication networks (broadcasting and gossiping). Combinatorial Network Theory. Applied Optimization, vol. 1, pp. 125\u2013212. Springer, New York (1996)"},{"key":"11_CR14","series-title":"Texts in Theoretical Computer Science","volume-title":"Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance","author":"J Hromkovi\u010d","year":"2005","unstructured":"Hromkovi\u010d, J., Klasing, R., Pelc, A., Ru\u017ei\u010dka, P., Unger, W.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. Springer, Berlin (2005)"},{"key":"11_CR15","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)"},{"unstructured":"Sun, C.M., Lin, C.K., Huang, H.M., Hsu, L.H.: Mutually independent Hamiltonian cycles in hypercubes. In: Proceedings of 8th Symposium on Parallel Architectures, Algorithms and Networks (2005)","key":"11_CR16"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.ins.2013.02.020","volume":"236","author":"V Vuka\u0161inovi\u0107","year":"2013","unstructured":"Vuka\u0161inovi\u0107, V., Gregor, P., \u0160krekovski, R.: On the mutually independent Hamiltonian cycles in faulty hypercubes. Inform. Sci. 236, 224\u2013235 (2013)","journal-title":"Inform. Sci."},{"unstructured":"Wu, K.-S., Juan, JS.-T.: Mutually independent Hamiltonian cycles of $$C_m \\times C_n$$ when $$m$$ , $$n$$ are odd. In: Proceedings of 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 165\u2013170 (2012)","key":"11_CR18"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T01:30:57Z","timestamp":1601170257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}