{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:53Z","timestamp":1725565253929},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_79","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T00:45:04Z","timestamp":1284165904000},"page":"745-754","source":"Crossref","is-referenced-by-count":1,"title":["A Spectral Technique to Solve the Chromatic Number Problem in Circulant Graphs"],"prefix":"10.1007","author":[{"given":"Monia","family":"Discepoli","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Gerace","sequence":"additional","affiliation":[]},{"given":"Riccardo","family":"Mariani","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Remigi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"79_CR1","first-page":"346","volume-title":"Proceedings of The 26th Annual Symposium on the Theory of Computing","author":"N. Alon","year":"1994","unstructured":"Alon, N., Kahale, N.: A Spectral Technique for Coloring Random 3-Colorable Graphs. In: Proceedings of The 26th Annual Symposium on the Theory of Computing, pp. 346\u2013355. ACM Press, New York (1994)"},{"key":"79_CR2","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/0605051","volume":"5","author":"B. Aspvall","year":"1984","unstructured":"Aspvall, B., Gilbert, J.R.: Graph Coloring using Eigenvalue Decomposition. Algebraic Discrete Methods\u00a05, 526\u2013538 (1984)","journal-title":"Algebraic Discrete Methods"},{"key":"79_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01840398","volume":"5","author":"B. Berger","year":"1990","unstructured":"Berger, B., Rompel, J.: A Better Performance Guarantee for Approximate Graph Coloring. Algorithmica\u00a05, 459\u2013466 (1990)","journal-title":"Algorithmica"},{"key":"79_CR4","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. Journal of Parallel andDistributed Computing\u00a024, 2\u201310 (1995)","journal-title":"Journal of Parallel andDistributed Computing"},{"key":"79_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608704","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1974","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University. Press, Cambridge (1974)"},{"key":"79_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(91)90024-Q","volume":"32","author":"R.E. Burkard","year":"1991","unstructured":"Burkard, R.E., Sandlholzer, W.: Efficiently solvable special cases of bottleneck travelling salesman problems. Discrete Applied Mathematics\u00a032, 61\u201376 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"79_CR7","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0909051","volume":"9","author":"T. Chan","year":"1988","unstructured":"Chan, T.: An Optimal Circulant Preconditioner for Toeplitz System. SIAM J. Sci. Stat. Comput.\u00a09, 766\u2013771 (1988)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"79_CR8","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1137\/S0036142999354083","volume":"38","author":"R. Chan","year":"2001","unstructured":"Chan, R., Yip, A.M., Ng, M.K.: The best Circulant Preconditioners for Hermitian Toeplitz matrices. SIAM J. Numeric. Anal.\u00a038, 876\u2013896 (2001)","journal-title":"SIAM J. Numeric. Anal."},{"key":"79_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0024-3795(98)10126-X","volume":"285","author":"B. Codenotti","year":"1998","unstructured":"Codenotti, B., Gerace, I., Vigna, S.: Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs. Linear Algebra and its Applications\u00a0285, 123\u2013142 (1998)","journal-title":"Linear Algebra and its Applications"},{"key":"79_CR10","volume-title":"Spectra of Graphs","author":"D.M. Cvectovi\u0107","year":"1978","unstructured":"Cvectovi\u0107, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Academic Press, New York (1978)"},{"key":"79_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0021-9800(70)80068-0","volume":"9","author":"B. Elspas","year":"1970","unstructured":"Elspas, B., Turner, J.: Graphs with Circulant Adjacency Matrices. J. of Combinatorial Theory\u00a09, 297\u2013307 (1970)","journal-title":"J. of Combinatorial Theory"},{"key":"79_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/anac.200310013","volume":"1","author":"I. Gerace","year":"2004","unstructured":"Gerace, I., Pucci, P., Ceccarelli, N., Discepoli, M., Mariani, R.: A Preconditioned Finite Elements Method for the p-Laplacian Parabolic Equation. Appl. Num. Anal. Comp. Math.\u00a01, 155\u2013164 (2004)","journal-title":"Appl. Num. Anal. Comp. Math."},{"key":"79_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is Hard to Approximate within n to the power (1-epsilon). Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"79_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"79_CR15","volume-title":"Introduction to parallel algorithms and architecture: Arrays, trees, hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architecture: Arrays, trees, hypercubes. M. Kaufman, San Francisco (1992)"},{"key":"79_CR16","unstructured":"Litow, B., Maus, B.: On isomorphic chordal ring. In: Proc. of The Seventh Australian Workshop on Combinatorial Algorithms (AWOCA 1996), BDCS-TR-508, pp. 108\u2013 111 (1996)"},{"key":"79_CR17","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM\u00a041, 960\u2013981 (1994)","journal-title":"Journal of the ACM"},{"key":"79_CR18","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0021-9800(67)80003-6","volume":"3","author":"J. Turner","year":"1967","unstructured":"Turner, J.: Point-Symmetric Graphs with Prime Number of Points. Journal of Combinatorial Theory\u00a03, 136\u2013145 (1967)","journal-title":"Journal of Combinatorial Theory"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:08:21Z","timestamp":1620011301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}