{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:23Z","timestamp":1725558983025},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_24","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"285-295","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Computation of the Lov\u00e1sz Theta Function for a Class of Circulant Graphs"],"prefix":"10.1007","author":[{"given":"Valentin E.","family":"Brimkov","sequence":"first","affiliation":[]},{"given":"Reneta P.","family":"Barneva","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"Klette","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"Straight","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","volume":"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, 8\u201319 (1956)","journal-title":"IRE Trans. Inform. Theory IT"},{"key":"24_CR2","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\u00a025, 267\u2013272 (1978)","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1090\/S0002-9939-1967-0207590-3","volume":"18","author":"M. Rosenfeld","year":"1967","unstructured":"Rosenfeld, M.: On a problem of Shannon. Proc. Amer. Mat. Soc.\u00a018, 315\u2013319 (1967)","journal-title":"Proc. Amer. Mat. Soc."},{"key":"24_CR4","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\u00a025, 1\u20137 (1979)","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-46521-9_24","volume-title":"Algorithms and Complexity","author":"V.E. Brimkov","year":"2000","unstructured":"Brimkov, V.E., Codenotti, B., Crespi, V., Leoncini, M.: On the lov\u00e1sz number of certain circulant graphs. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol.\u00a01767, pp. 291\u2013305. Springer, Heidelberg (2000)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0024-3795(87)90285-0","volume":"86","author":"H. Minc","year":"1987","unstructured":"Minc, H.: Permanental compounds and permanents of (0,1) circulants. Linear Algebra and its Applications\u00a086, 11\u201346 (1987)","journal-title":"Linear Algebra and its Applications"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J.-C. Bermond","year":"1995","unstructured":"Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: A survey. J. of Parallel and Distributed Computing\u00a024, 2\u201310 (1995)","journal-title":"J. of Parallel and Distributed Computing"},{"key":"24_CR8","volume-title":"Introduction to parallel algorithms and architecture: Arrays, trees, hypercubes","author":"F.T. Leighton","year":"1996","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architecture: Arrays, trees, hypercubes. M. Kaufmann, San Francisco (1996)"},{"key":"24_CR9","unstructured":"Liton, B., Mans, B.: On isomorphic chordal rings. In: Proc. of the Seventh Australian Workshop on Combinatorial Algorithms (AWOCA 1996), Univ. of Sydney, BDCSTR- 508, 108-111 (1996)"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jpdc.1997.1389","volume":"46","author":"B. Mans","year":"1997","unstructured":"Mans, B.: Optimal distributed algorithms in unlabel tori and chordal rings. J. of Parallel and Distributed Computing\u00a046(1), 80\u201390 (1997)","journal-title":"J. of Parallel and Distributed Computing"},{"issue":"4","key":"24_CR11","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/PROC.1972.8647","volume":"60","author":"W.J. Bouknight","year":"1972","unstructured":"Bouknight, W.J., Denenberg, S.A., McIntyre, D.E., Randall, J.M., Samel, A.H., Slotnick, D.L.: The Illiac IV System. Proc. IEEE\u00a060(4), 369\u2013378 (1972)","journal-title":"Proc. IEEE"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1109\/TCOM.1972.1091214","volume":"20","author":"R.S. Wilkov","year":"1972","unstructured":"Wilkov, R.S.: Analysis and design of reliable computer networks. IEEE Trans. On Communications\u00a020, 660\u2013678 (1972)","journal-title":"IEEE Trans. On Communications"},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"C.K. Wong","year":"1974","unstructured":"Wong, C.K., Coppersmith, D.: A combinatorial problem related to multimodule memory organization. Journal of the ACM\u00a021(3), 392\u2013402 (1974)","journal-title":"Journal of the ACM"},{"key":"24_CR14","first-page":"1109","volume":"393","author":"A. Ad\u00e1m","year":"1991","unstructured":"Ad\u00e1m, A.: Research problem 2-10. J. Combinatorial Theory\u00a0393, 1109\u20131124 (1991)","journal-title":"J. Combinatorial Theory"},{"issue":"10","key":"24_CR15","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1109\/12.93744","volume":"30","author":"R. Beivide","year":"1991","unstructured":"Beivide, R., Herrada, E., Balc\u00e1zar, J.L., Arruabarrena, A.: Optimal distance networks of low degree for parallel computers. IEEE Trans. on Computers C-30(10), 1109\u20131124 (1991)","journal-title":"IEEE Trans. on Computers C"},{"issue":"7","key":"24_CR16","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/71.940745","volume":"12","author":"Y. Yang","year":"2001","unstructured":"Yang, Y., Funashashi, A., Jouraku, A., Nishi, H., Amano, H., Sueyoshi, T.: Recursive diagonal torus: an interconnection network for massively parallel computers. IEEE Trans. on Parallel and Distributed Systems\u00a012(7), 701\u2013715 (2001)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1109\/18.556133","volume":"43","author":"K. Huber","year":"1997","unstructured":"Huber, K.: Codes over tori. IEEE Trans. on Information Theory\u00a043(2), 740\u2013744 (1997)","journal-title":"IEEE Trans. on Information Theory"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Rosenfeld, A., Klette, R.: Digital straightness. Electronic Notes in Theoretical Computer Science vol. 46 (2001), http:\/\/www.elsevier.nl\/locate\/entcs,volume46.html","DOI":"10.1016\/S1571-0661(04)80976-9"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1109\/TPAMI.1984.4767577","volume":"6","author":"L. Dorst","year":"1984","unstructured":"Dorst, L., Duin, R.P.W.: Spirograph theory: a framework for calculations on digitized straight lines. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a06, 632\u2013639 (1984)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-30559-0_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V.E. Brimkov","year":"2004","unstructured":"Brimkov, V.E., Barneva, R.P., Klette, R., Straight, J.: Lov\u00e1sz theta-function of a class of graphs representing digital lines. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 285\u2013295. Springer, Heidelberg (2004)"},{"key":"24_CR21","unstructured":"Alizadeh, F., et al.: SDPPACK user\u2019s guide, http:\/\/www.cs.nyu.edu\/faculty\/overton\/sdppack,sdppack.html"},{"key":"24_CR22","unstructured":"Berge, C.: Graphs, North-Holland Mathematical Library (1985)"},{"key":"24_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1193","volume":"1","author":"D.E. Knuth","year":"1994","unstructured":"Knuth, D.E.: The sandwich theorem. Electronic J. Combinatorics\u00a01, 1\u201348 (1994)","journal-title":"Electronic J. Combinatorics"},{"issue":"1","key":"24_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optimization\u00a05(1), 13\u201351 (1995)","journal-title":"SIAM J. Optimization"},{"key":"24_CR25","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\u00a019, 1\u20135 (1998)","journal-title":"European J. Combinatorics"},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1109\/18.412676","volume":"33","author":"N. Alon","year":"1995","unstructured":"Alon, N., Orlitsky, A.: Repeated communication and Ramsey graphs. IEEE Trans. on Inf. Theory\u00a033, 1276\u20131289 (1995)","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"24_CR27","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TIT.1987.1057326","volume":"33","author":"J.J. Ashley","year":"1987","unstructured":"Ashley, J.J., Siegel, P.H.: A note on the Shannon Capacity of run-length-limited codes. IEEE Trans. on Inf. Theory IT-33, 601\u2013605 (1987)","journal-title":"IEEE Trans. on Inf. Theory IT"},{"key":"24_CR28","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\u00a07, 67\u201372 (1986)","journal-title":"SIAM J. on Alg. And Disc. Methods"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"Feige, U.: Randomized graph products, chromatic numbers, and the Lov\u00e1sz \u03b8- function. In: Proc of the 27th STOC, pp. 635\u2013640 (1995)","DOI":"10.1145\/225058.225281"},{"issue":"1","key":"24_CR30","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. of ACM\u00a031(1), 114\u2013127 (1984)","journal-title":"J. of AC"}],"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\/978-3-540-30559-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:22:20Z","timestamp":1605759740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}