{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T11:22:53Z","timestamp":1758280973020},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_24","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T22:47:16Z","timestamp":1194130036000},"page":"291-305","source":"Crossref","is-referenced-by-count":8,"title":["On the Lov\u00e1sz Number of Certain Circulant Graphs"],"prefix":"10.1007","author":[{"given":"Valentin E.","family":"Brimkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Codenotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentino","family":"Crespi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Leoncini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"24_CR1","unstructured":"Alizadeh, F., Haeberly, J.-P. A., Nayakkankuppam, M., Overton, M., Schmieta, S.: SDPPACK User\u2019s Guide. http:\/\/www.cs.nyu.edu\/faculty\/overton\/sdppack\/sdppack.html"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/eujc.1997.0148","volume":"19","author":"N. Alon","year":"1998","unstructured":"Alon, N.: On the Capacity of Digraphs. European J. Combinatorics, 19 (1998) 1\u20135","journal-title":"European J. Combinatorics"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/18.412676","volume":"41","author":"N. Alon","year":"1995","unstructured":"Alon, N., Orlitsky, A.: Repeated Communication and Ramsey Graphs. IEEE Trans. on Inf. Theory, 41 (1995) 1276\u20131289","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Ashley, Siegel: A Note on the Shannon Capacity of Run-Length-Limited Codes. IEEE Trans. on Inf. Theory, 33 (1987)","DOI":"10.1109\/TIT.1987.1057326"},{"key":"24_CR5","unstructured":"Brimkov, V.E., Codenotti, B., Crespi, V., Leoncini, M.: Efficient Computation of the Lov\u00e1sz Number of Circulant Graphs. In preparation"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/0607008","volume":"7","author":"M. Farber","year":"1986","unstructured":"Farber, M.: An Analogue of the Shannon Capacity of a Graph. SIAM J. on Alg. and Disc. Methods, 7 (1986) 67\u201372","journal-title":"SIAM J. on Alg. and Disc. Methods"},{"key":"24_CR7","unstructured":"Feige, U.: Randomized Graph Products, Chromatic Numbers, and the Lov\u00e1sz \u03d1-Function. Proc. of the 27th STOC (1995) 635\u2013640"},{"key":"24_CR8","first-page":"267","volume":"25","author":"W. Haemers","year":"1978","unstructured":"Haemers, W.: An Upper Bound for the Shannon Capacity of a Graph. Colloq. Math. Soc. J\u00e1nos Bolyai, 25 (1978) 267\u201372","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1109\/TIT.1979.1056027","volume":"25","author":"W. Haemers","year":"1979","unstructured":"Haemers, W.: On Some Problems of Lov\u00e1sz Concerning the Shannon Capacity of Graphs. IEEE Trans. on Inf. Theory, 25 (1979) 231\u2013232","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: The Sandwich Theorem. Electronic J. Combinatorics, 1 (1994)","DOI":"10.37236\/1193"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon Capacity of a Graph. IEEE Trans. on Inf. Theory, 25 (1979) 1\u20137","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"24_CR12","unstructured":"O'Rourke, J.: Computational Geometry in C. Cambridge University Press (1994)"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.2307\/2035288","volume":"18","author":"M. Rosenfeld","year":"1967","unstructured":"Rosenfeld, M.: On a Problem of Shannon. Proc. Amer. Math. Soc., 18 (1967) 315\u2013319","journal-title":"Proc. Amer. Math. Soc."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"IT-2","author":"C.E. Shannon","year":"1956","unstructured":"Shannon, C.E.: The Zero-Error Capacity of a Noisy Channel. IRE Trans. Inform. Theory, IT-2 (1956) 8\u201319","journal-title":"IRE Trans. Inform. Theory"},{"key":"24_CR15","unstructured":"Szegedy, M.: A Note on the \u03d1 Number of Lov\u00e1sz and the Generalized Delsarte Bound. Proc. of the 35th FOCS, (1994) 36\u201341"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T20:24:43Z","timestamp":1588019083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}