{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:08Z","timestamp":1740122408689,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,3,9]],"date-time":"2018-03-09T00:00:00Z","timestamp":1520553600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["GA14-10799S"],"award-info":[{"award-number":["GA14-10799S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0383"],"award-info":[{"award-number":["P1-0383"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-018-0274-x","type":"journal-article","created":{"date-parts":[[2018,3,9]],"date-time":"2018-03-09T09:48:46Z","timestamp":1520588926000},"page":"1333-1355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Broadcasting multiple messages in the 1-in port model in optimal time"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3608-2533","authenticated-orcid":false,"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":[[2018,3,9]]},"reference":[{"key":"274_CR1","doi-asserted-by":"publisher","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 (2000) Optimal multiple message broadcasting in telephone-like communication systems. Discrete Appl Math 100:1\u201315","journal-title":"Discrete Appl Math"},{"key":"274_CR2","doi-asserted-by":"crossref","unstructured":"Bruck J, Cypher R, Ho CT (1992) Multiple message broadcasting with generalized Fibonacci trees. In: Proceedings of the 4th symposium on parallel and distributed processing, pp 424\u2013431","DOI":"10.1109\/SPDP.1992.242714"},{"key":"274_CR3","doi-asserted-by":"publisher","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 (2014) All-to-all broadcast problem of some classes of graphs under the half duplex all-port model. Discrete Appl Math 173:28\u201334","journal-title":"Discrete Appl Math"},{"key":"274_CR4","first-page":"27","volume-title":"Lecture Notes in Computer Science","author":"Fei Chen","year":"2014","unstructured":"Chen F, Wu X (2014) Perfect pipelining for streaming large file in peer-to-peer networks. In: Proceedings of the 8th IFIP international conference on theoretical computer science, Lecture notes in computer science, vol 8705, pp 27\u201338"},{"key":"274_CR5","first-page":"276","volume":"137","author":"G Fertin","year":"2013","unstructured":"Fertin G, Raspaud A (2013) A survey on Kn\u00f6del graphs. Discrete Appl Math 137:276\u2013289","journal-title":"Discrete Appl Math"},{"key":"274_CR6","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/0139032","volume":"39","author":"A Farley","year":"1980","unstructured":"Farley A (1980) Broadcast time in communication networks. SIAM J Appl Math 39:385\u2013390","journal-title":"SIAM J Appl Math"},{"key":"274_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1002\/net.1033","volume":"38","author":"P Fraigniaud","year":"2001","unstructured":"Fraigniaud P, Peters JG (2001) Minimum linear gossip graphs and maximal linear $$(\\Delta, k)$$ ( \u0394 , k ) -gossip graphs. Networks 38:150\u2013162","journal-title":"Networks"},{"key":"274_CR8","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 (2015) Rooted level-disjoint partitions of Cartesian products. Appl Math Comput 266:244\u2013258","journal-title":"Appl Math Comput"},{"key":"274_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-48749-6_11","volume-title":"Combinatorial Optimization and Applications","author":"Petr Gregor","year":"2016","unstructured":"Gregor P, \u0160krekovski R, Vuka\u0161inovi\u0107 V (2016) Time-optimal broadcasting of multiple messages in 1-in port model. In: Proceedings of the 10th international conference on combinatorial optimization and applications (COCOA 2016), Lecture notes in computer science, vol 10043, pp 144\u2013158"},{"key":"274_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.amc.2017.12.018","volume":"325","author":"P Gregor","year":"2018","unstructured":"Gregor P, \u0160krekovski R, Vuka\u0161inovi\u0107 V (2018) Modelling simultaneous broadcasting by level-disjoint partitions. Appl Math Comput 325:15\u201323","journal-title":"Appl Math Comput"},{"key":"274_CR11","unstructured":"Grigoryan H (2013) Problems related to broadcasting in graphs. Ph.D. thesis, Concordia University, Montreal, Quebec, Canada"},{"key":"274_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2014.02.005","volume":"171","author":"H Grigoryan","year":"2014","unstructured":"Grigoryan H, Harutyunyan HA (2014) Diametral broadcast graphs. Discrete Appl Math 171:53\u201359","journal-title":"Discrete Appl Math"},{"key":"274_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1002\/net.20110","volume":"47","author":"HA Harutyunyan","year":"2006","unstructured":"Harutyunyan HA (2006) Minimum multiple message broadcast graphs. Networks 47:218\u2013224","journal-title":"Networks"},{"key":"274_CR14","unstructured":"Harutyunyan HA (2000) Multiple message broadcasting in modified Kn\u00f6del graphs. In: Proceedings of the 7th international colloquium on structural information and communication complexity, pp 157\u2013165"},{"key":"274_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"SM Hedetniemi","year":"1988","unstructured":"Hedetniemi SM, Hedetniemi ST, Liestman AL (1988) A survey of gossiping and broadcasting in communication networks. Networks 18:319\u2013349","journal-title":"Networks"},{"key":"274_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-1-4757-2491-2_5","volume-title":"Combinatorial network theory, applied optimization","author":"J Hromkovi\u010d","year":"1996","unstructured":"Hromkovi\u010d J, Klasing R, Monien B, Piene R (1996) Dissemination of information in communication networks (broadcasting and gossiping). In: Du DZ, Hsu DF (eds) Combinatorial network theory, applied optimization, vol 1. Springer, Berlin, pp 125\u2013212"},{"key":"274_CR17","volume-title":"Dissemination of information in communication networks: broadcasting, gossiping, leader election, and fault-tolerance. Texts in theoretical computer science","author":"J Hromkovi\u010d","year":"2005","unstructured":"Hromkovi\u010d J, Klasing R, Pelc A, Ru\u017ei\u010dka P, Unger W (2005) Dissemination of information in communication networks: broadcasting, gossiping, leader election, and fault-tolerance. Texts in theoretical computer science. Springer, Berlin"},{"key":"274_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W Kn\u00f6del","year":"1975","unstructured":"Kn\u00f6del W (1975) New gossips and telephones. Discrete Math 13:95","journal-title":"Discrete Math"},{"key":"274_CR19","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Mateo"},{"key":"274_CR20","unstructured":"Sun CM, Lin CK, Huang HM, Hsu LH (2005) Mutually independent Hamiltonian cycles in hypercubes. In: Proceedings of the 8th symposium on parallel architectures, algorithms and networks"},{"key":"274_CR21","doi-asserted-by":"publisher","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 (2013) On the mutually independent Hamiltonian cycles in faulty hypercubes. Inf Sci 236:224\u2013235","journal-title":"Inf Sci"},{"key":"274_CR22","unstructured":"Wu K-S, Juan JS-T (2012) Mutually independent Hamiltonian cycles of $$C_m \\times C_n$$ C m \u00d7 C n when $$m$$ m , $$n$$ n are odd. In: Proceedings of the 29th workshop on combinatorial mathematics and computation theory, pp 165\u2013170"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0274-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0274-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0274-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,29]],"date-time":"2020-10-29T04:46:18Z","timestamp":1603946778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0274-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,9]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["274"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0274-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,3,9]]},"assertion":[{"value":"9 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}