{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T09:43:37Z","timestamp":1747215817124},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411833"},{"type":"electronic","value":"9783540400646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40064-8_15","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:25:42Z","timestamp":1186878342000},"page":"149-160","source":"Crossref","is-referenced-by-count":9,"title":["Diameter of the Kn\u00f6del Graph"],"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"}]},{"given":"Heiko","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ondrej","family":"S\u00fdkora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imrich","family":"Vr\u0165o","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"15_CR1","unstructured":"de Rumeur, J., Communications dans les R\u00e9seaux de Processeurs. Masson, Paris, 1994."},{"key":"15_CR2","unstructured":"Demetrovics, J., Peth\u0150, A., R\u00f3nyai, L., On +-1 representations of integers, submitted for publication."},{"key":"15_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Towards optimal load balancing topologies","author":"T. Decker","year":"2000","unstructured":"Decker, T., Monien, B., Preis, R., Towards optimal load balancing topologies, in: Proc. EUROPAR\u20192000, Lecture Notes in Computer Science, Springer Verlag, Berlin, 2000."},{"key":"15_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/3-540-54522-0_104","volume-title":"Algebraic constructions of efficient broadcast networks","author":"M. J. Dinneen","year":"1991","unstructured":"Dinneen, M. J., Fellows, M. R., Faber, V., Algebraic constructions of efficient broadcast networks, in: Proc. of Applied Algebra, Algorithms and Error Correcting Codes, Lecture Notes in Computer Science 539, Springer Verlag, Berlin, 1991, 152\u2013158."},{"key":"15_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/10692760_6","volume-title":"Families of graphs having broadcasting and gossiping properties","author":"G. Fertin","year":"1998","unstructured":"Fertin, G., Raspaud, A., Families of graphs having broadcasting and gossiping properties, in: Proc. of the 24th Intl. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 1517, Springer Verlag, Berlin, 1998, 63\u201377."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E., Methods and problems of communication in usual networks, Discrete Applied Mathematics 53 (1994), 79\u2013133.","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR7","unstructured":"Fraigniaud, P., Peters, J.G., Minimum Linear Gossip Graphs and Maximal Linear (\u03b4, k)-Gossip Graphs. Technical Report 94-06, School of Computing Science, Simon Fraser Univ., 1994. (\n                  ftp:\/\/fas.sfu.ca\/pub\/cs\/techreports\/1994\/CMPT94-06.ps.gz\n                  \n                )"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. M. Hedetniemi","year":"1988","unstructured":"Hedetniemi, S. M., Hedetniemi, S. T., Liestman, A. L., A survey of gossiping and broadcasting in communication networks. Networks 18(1988), 319\u2013349.","journal-title":"Networks"},{"key":"15_CR9","first-page":"125","volume-title":"Combinatorial Network Theory","author":"J. Hromkovi\u0109","year":"1995","unstructured":"Hromkovi\u0109, J., Klasing, R., Monien, R., Peine, R., Dissemination of information in interconnection networks (Broadcasting and Gossiping), in: Combinatorial Network Theory Eds.: Frank Hsu, Ding-Zhu Du, 1995, Kluwer, Academic Publishers, 125\u2013212."},{"key":"15_CR10","unstructured":"Khachatrian, L. H., Haroutunian, H. S., Construction of new classes of minimal broadcast networks, in: Proc. of the 3rd Intl. Colloquium on Coding Theory, 1990, 69\u201377."},{"key":"15_CR11","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., New gossips and telephones, Discrete Mathematics 13 (1975), 95.","journal-title":"Discrete Mathematics"},{"key":"15_CR12","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 23 (1993), 333\u2013341.","journal-title":"Networks"},{"key":"15_CR13","unstructured":"Park, J.-H., Chwa, K.-Y., Recursive circulant: a new topology for multicomputers networks (extended abstract), in: Proc. of the Intl. Symposium on Parallel Architectures, Algorithms and Networks, 1994, 73\u201380."}],"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\/3-540-40064-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T07:35:30Z","timestamp":1550734530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40064-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411833","9783540400646"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-40064-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}