{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:56Z","timestamp":1725558656584},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651956"},{"type":"electronic","value":"9783540494942"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/10692760_6","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T16:35:37Z","timestamp":1277915737000},"page":"63-77","source":"Crossref","is-referenced-by-count":5,"title":["Families of Graphs Having Broadcasting and Gossiping Properties"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"de Rumeur, J.: Communications dans les r\u00e9seaux d\u2019interconnexion. Masson (1994)"},{"key":"6_CR2","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":"M.J. Dinneen","year":"1991","unstructured":"Dinneen, M.J., Fellows, M.R., Faber, V.: Algebraic constructions of efficient broadcast networks. In: Mattson, H.F., Rao, T.R.N., Mora, T. (eds.) AAECC 1991. LNCS, vol.\u00a0539, pp. 152\u2013158. Springer, Heidelberg (1991)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230090404","volume":"9","author":"A. Farley","year":"1979","unstructured":"Farley, A.: Minimal broadcast networks. Networks\u00a09, 313\u2013332 (1979)","journal-title":"Networks"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","volume":"25","author":"A. Farley","year":"1979","unstructured":"Farley, A., Hedetniemi, S., Mitchell, S., Proskurowski, A.: Minimum broadcast graphs. Discrete Mathematics\u00a025, 189\u2013193 (1979)","journal-title":"Discrete Mathematics"},{"key":"6_CR5","unstructured":"Fertin, G.: On the structure of minimum broadcast digraphs. Technical Report RR-1173-97, Laboratoire Bordelais de Recherche en Informatique (1997) (Submitted)"},{"key":"6_CR6","unstructured":"Fertin, G.: A study of minimum gossip graphs. Technical Report RR-1172-97, Laboratoire Bordelais de Recherche en Informatique (1997) (Submitted)"},{"key":"6_CR7","unstructured":"Fraigniaud, P., Peters, J.G.: Minimum linear gossip graphs and maximal linear (\u03b4, k)-gossip graphs. Technical Report CMPT TR 94-06, Simon Fraser University, Burnaby, B.C (1994)"},{"key":"6_CR8","unstructured":"Heydemann, M.-C.: Private communication (1998)"},{"key":"6_CR9","unstructured":"Khachatrian, L.H., Haroutunian, H.S.: Construction of new classes of minimal broadcast networks. In: Proc. Third International Colloquium on Coding Theory, pp. 69\u201377 (1990)"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W. Knodel","year":"1975","unstructured":"Knodel, W.: New gossips and telephones. Discrete Mathematics\u00a013, 95 (1975)","journal-title":"Discrete Mathematics"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/net.3230230416","volume":"23","author":"R. Labahn","year":"1993","unstructured":"Labahn, R.: Some minimum gossip graphs. Networks\u00a023, 333\u2013341 (1993)","journal-title":"Networks"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(82)90139-X","volume":"39","author":"J.-M. Laborde","year":"1982","unstructured":"Laborde, J.-M., Rao Hebbare, S.P.: Another characterization of hypercubes. Discrete Math.\u00a039, 161\u2013166 (1982)","journal-title":"Discrete Math."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/0166-218X(92)90148-4","volume":"37\/38","author":"A.L. Liestman","year":"1992","unstructured":"Liestman, A.L., Peters, J.G.: Minimum broadcast digraphs. Discrete Applied Mathematics\u00a037\/38, 401\u2013419 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR14","unstructured":"Micheneau, C.: Graphes R\u00e9cursifs Circulants: Structure et Communications. Communications Vagabondes et Simulation. PhD thesis, Universit\u00e9 Bordeaux I (1996)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Mulder, M.: (0,\u03bb)-graphs and n-cubes. Discrete Math.\u00a028, 179\u2013188 (1979)","DOI":"10.1016\/0012-365X(79)90095-5"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(92)00094-8","volume":"124","author":"J.-H. Park","year":"1994","unstructured":"Park, J.-H., Chwa, K.-Y.: On the construction of regular minimal broadcast digraphs. Theoretical Computer Science\u00a0124, 329\u2013342 (1994)","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","unstructured":"Park, J.-H., Chwa, K.-Y.: Recursive circulant: a new topology for multicomputers networks (extended abstract). In: Proc. Int. Symp. Parallel Architectures, Algorithms and Networks ISPAN 1994, Kanazawa, Japan, pp. 73\u201380 (1994)"}],"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\/10692760_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T16:08:41Z","timestamp":1559232521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10692760_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651956","9783540494942"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/10692760_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}