{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:42Z","timestamp":1725879702172},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_18","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"193-204","source":"Crossref","is-referenced-by-count":3,"title":["Broadcast Graphs Using New Dimensional Broadcast Schemes for Kn\u00f6del Graphs"],"prefix":"10.1007","author":[{"given":"Hovhannes A.","family":"Harutyunyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.dam.2014.01.025","volume":"171","author":"A Averbuch","year":"2014","unstructured":"Averbuch, A., Shabtai, R.H., Roditty, Y.: Efficient construction of broadcast graphs. Discret. Appl. Math. 171, 9\u201314 (2014)","journal-title":"Discret. Appl. Math."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2014.05.018","volume":"175","author":"G Barsky","year":"2014","unstructured":"Barsky, G., Grigoryan, H., Harutyunyan, H.A.: Tight lower bounds on broadcast function for n = 24 and 25. Discret. Appl. Math. 175, 109\u2013114 (2014)","journal-title":"Discret. Appl. Math."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230260302","volume":"26","author":"J-C Bermond","year":"1995","unstructured":"Bermond, J.-C., Fraigniaud, P., Peters, J.G.: Antepenultimate broadcasting. Networks 26, 125\u2013137 (1995)","journal-title":"Networks"},{"issue":"02","key":"18_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1142\/S0129054197000094","volume":"8","author":"J-C Bermond","year":"1997","unstructured":"Bermond, J.-C., Harutyunyan, H.A., Liestman, A.L., Perennes, S.: A note on the dimensionality of modified Kn\u00f6del graphs. Int. J. Found. Comput. Sci. 8(02), 109\u2013116 (1997)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0166-218X(92)90226-Z","volume":"36","author":"J-C Bermond","year":"1992","unstructured":"Bermond, J.-C., Hell, P., Liestman, A.L., Peters, J.G.: Sparse broadcast graphs. Discret. Appl. Math. 36, 97\u2013130 (1992)","journal-title":"Discret. Appl. Math."},{"key":"18_CR6","first-page":"110","volume":"10","author":"SC Chau","year":"1985","unstructured":"Chau, S.C., Liestman, A.L.: Constructing minimal broadcast networks. J. Comb. Inf. Syst. Sci. 10, 110\u2013122 (1985)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-54522-0_104","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"MJ Dinneen","year":"1991","unstructured":"Dinneen, M.J., Fellows, M.R., Faber, V.: Algebraic constructions of efficient broadcast networks. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds.) AAECC 1991. LNCS, vol. 539, pp. 152\u2013158. Springer, Heidelberg (1991). doi: 10.1007\/3-540-54522-0_104"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0166-218X(99)00043-8","volume":"93","author":"MJ Dinneen","year":"1999","unstructured":"Dinneen, M.J., Ventura, J.A., Wilson, M.C., Zakeri, G.: Compound constructions of broadcast networks. Discret. Appl. Math. 93, 205\u2013232 (1999)","journal-title":"Discret. Appl. Math."},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230090404","volume":"9","author":"AM Farley","year":"1979","unstructured":"Farley, A.M.: Minimal broadcast networks. Networks 9, 313\u2013332 (1979)","journal-title":"Networks"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","volume":"25","author":"AM Farley","year":"1979","unstructured":"Farley, A.M., Hedetniemi, S., Mitchell, S., Proskurowski, A.: Minimum broadcast graphs. Discret. Math. 25, 189\u2013193 (1979)","journal-title":"Discret. Math."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0166-218X(03)00260-9","volume":"137","author":"G Fertin","year":"2004","unstructured":"Fertin, G., Raspaud, A.: A survey on Kn\u00f6del graphs. Discret. Appl. Math. 137, 173\u2013195 (2004)","journal-title":"Discret. Appl. Math."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1002\/net.3230190606","volume":"19","author":"L Gargano","year":"1989","unstructured":"Gargano, L., Vaccaro, U.: On the construction of minimal broadcast networks. Networks 19, 673\u2013689 (1989)","journal-title":"Networks"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0404021","volume":"4","author":"M Grigni","year":"1991","unstructured":"Grigni, M., Peleg, D.: Tight bounds on mimimum broadcast networks. SIAM J. Discret. Math. 4, 207\u2013222 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-07956-1_16","volume-title":"Algorithmic Aspects in Information and Management","author":"H Grigoryan","year":"2014","unstructured":"Grigoryan, H., Harutyunyan, H.A.: New lower bounds on broadcast function. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 174\u2013184. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-07956-1_16"},{"issue":"3","key":"18_CR15","first-page":"197","volume":"5","author":"HA Harutyunyan","year":"2009","unstructured":"Harutyunyan, H.A.: An efficient vertex addition method for broadcast networks. Internet Math. 5(3), 197\u2013211 (2009)","journal-title":"Internet Math."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-29221-2_17","volume-title":"Algorithms and Discrete Applied Mathematics","author":"HA Harutyunyan","year":"2016","unstructured":"Harutyunyan, H.A., Li, Z.: A new construction of broadcast graphs. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 201\u2013211. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29221-2_17"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0166-218X(99)00108-0","volume":"98","author":"HA Harutyunyan","year":"1999","unstructured":"Harutyunyan, H.A., Liestman, A.L.: More broadcast graphs. Discret. Appl. Math. 98, 81\u2013102 (1999)","journal-title":"Discret. Appl. Math."},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1002\/1097-0037(200103)37:2<94::AID-NET4>3.0.CO;2-6","volume":"37","author":"HA Harutyunyan","year":"2001","unstructured":"Harutyunyan, H.A., Liestman, A.L.: Improved upper and lower bounds for k-broadcasting. Networks 37, 94\u2013101 (2001)","journal-title":"Networks"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"2992","DOI":"10.1016\/j.disc.2012.06.016","volume":"312","author":"HA Harutyunyan","year":"2012","unstructured":"Harutyunyan, H.A., Liestman, A.L.: Upper bounds on the broadcast function using minimum dominating sets. Discret. Math. 312, 2992\u20132996 (2012)","journal-title":"Discret. Math."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Harutyunyan, H.A., Liestman, A.L., Peters, J.G., Richards, D.: Broadcasting and gossiping. In: Handbook of Graph Theorey, pp. 1477\u20131494. Chapman and Hall (2013)","DOI":"10.1201\/b16132-87"},{"key":"18_CR21","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":"18_CR22","unstructured":"Khachatrian, L.H., Harutounian, H.S.: Construction of new classes of minimal broadcast networks. In: Conference on Coding Theory, Dilijan, Armenia, pp. 69\u201377 (1990)"},{"key":"18_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W Kn\u00f6del","year":"1975","unstructured":"Kn\u00f6del, W.: New gossips and telephones. Discret. Math. 13, 95 (1975)","journal-title":"Discret. Math."},{"key":"18_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0166-218X(94)90188-0","volume":"53","author":"R Labahn","year":"1994","unstructured":"Labahn, R.: A minimum broadcast graph on 63 vertices. Discret. Appl. Math. 53, 247\u2013250 (1994)","journal-title":"Discret. Appl. Math."},{"key":"18_CR25","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(94)90190-2","volume":"53","author":"M Maheo","year":"1994","unstructured":"Maheo, M., Sacl\u00e9, J.-F.: Some minimum broadcast graphs. Discret. Appl. Math. 53, 275\u2013285 (1994)","journal-title":"Discret. Appl. Math."},{"key":"18_CR26","first-page":"141","volume":"5","author":"S Mitchell","year":"1980","unstructured":"Mitchell, S., Hedetniemi, S.: A census of minimum broadcast graphs. J. Comb. Inf. Syst. Sci. 5, 141\u2013151 (1980)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Park, J.-H., Chwa, K.-Y.: Recursive circulant: a new topology for multicomputer networks. In: International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), pp. 73\u201380. IEEE (1994)","DOI":"10.1109\/ISPAN.1994.367162"},{"key":"18_CR28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(95)00200-G","volume":"150","author":"J-F Sacl\u00e9","year":"1996","unstructured":"Sacl\u00e9, J.-F.: Lower bounds for the size in four families of minimum broadcast graphs. Discret. Math. 150, 359\u2013369 (1996)","journal-title":"Discret. Math."},{"key":"18_CR29","unstructured":"Shao, B.: On K-broadcasting in graphs. Ph.D. thesis, Concordia University (2006)"},{"key":"18_CR30","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/net.3230230505","volume":"23","author":"JA Ventura","year":"1993","unstructured":"Ventura, J.A., Weng, X.: A new method for constructing minimal broadcast networks. Networks 23, 481\u2013497 (1993)","journal-title":"Networks"},{"key":"18_CR31","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02110308","volume":"3","author":"MX Weng","year":"1994","unstructured":"Weng, M.X., Ventura, J.A.: A doubling procedure for constructing minimal broadcast networks. Telecommun. Syst. 3, 259\u2013293 (1994)","journal-title":"Telecommun. Syst."},{"key":"18_CR32","first-page":"99","volume":"11","author":"J Xiao","year":"1988","unstructured":"Xiao, J., Wang, X.: A research on minimum broadcast graphs. Chin. J. Comput. 11, 99\u2013105 (1988)","journal-title":"Chin. J. Comput."},{"key":"18_CR33","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1016\/S0893-9659(01)00082-9","volume":"14","author":"J Zhou","year":"2001","unstructured":"Zhou, J., Zhang, K.: A minimum broadcast graph on 26 vertices. Appl. Math. Lett. 14, 1023\u20131026 (2001)","journal-title":"Appl. Math. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:22Z","timestamp":1498368922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}