{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:37Z","timestamp":1725543397208},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351573"},{"type":"electronic","value":"9783540351580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775096_26","type":"book-chapter","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T08:40:18Z","timestamp":1150965618000},"page":"279-290","source":"Crossref","is-referenced-by-count":0,"title":["A New Approach for Solving the Maximum Clique Problem"],"prefix":"10.1007","author":[{"given":"P. J.","family":"Taillon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Abu-Khzam, F.N., Langston, M.A., Shanbhag, P.: Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. In: Proceedings of the International Conference on Parallel and Distributed Computing and Systems (November 2003)"},{"key":"26_CR2","unstructured":"Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proceedings of the ACM-SIAM Workshop on Algorithm Engineering and Experiments (January 2004)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01955041","volume":"15","author":"E. Balas","year":"1996","unstructured":"Balas, E., Xue, J.: Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica\u00a015, 397\u2013412 (1996)","journal-title":"Algorithmica"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Baldwin, N.E., Collins, R.L., Leuze, M.R., Langston, M.A., Symons, C.T., Voy, B.H.: High-performance computational tools for motif discovery. In: Proceedings of the IEEE International Workshop on High Performance Computational Biology (April 2004)","DOI":"10.1109\/IPDPS.2004.1303210"},{"key":"26_CR5","unstructured":"Bar-Yehuda, R., Dabholkar, V., Govindarajan, K., Sivakumar, D.: Randomized local approximations with applications to the MAX-CLIQUE problem. Technical Report 93-30, University at Buffalo (1993)"},{"key":"26_CR6","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, Pardalos (eds.) Handbook of Combinatorial Optimization, vol.\u00a0A, pp. 1\u201374. Kluwer, Dordrecht (1999)"},{"issue":"4","key":"26_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/S0022-0000(03)00075-8","volume":"67","author":"J. Cheetham","year":"2003","unstructured":"Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: Solving large FPT problems on coarse grained parallel machines. Journal of Computer and System Sciences\u00a067(4), 691\u2013706 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: A parallel FPT application for clusters. In: Proceedings of the 3rd IEEE\/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2003), Tokyo, Japan, pp. 70\u201377 (2003)","DOI":"10.1109\/CCGRID.2003.1199354"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-46784-X_30","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Chen","year":"1999","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: Further observations and further improvements. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 313\u2013324. Springer, Heidelberg (1999)"},{"key":"26_CR10","unstructured":"DIMACS clique benchmarks (1993), \n                    \n                      ftp:\/\/dimacs.rutgers.edu\/pub\/challenge\/graph\/"},{"key":"26_CR11","first-page":"161","volume":"87","author":"R.G. Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congressus Numerantium\u00a087, 161\u2013187 (1992)","journal-title":"Congressus Numerantium"},{"key":"26_CR12","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0304-3975(96)00317-9","volume":"191","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R., Regan, K.W.: Parameterized Circuit Complexity and the W Hierarchy. Theoretical Computer Science A\u00a0191, 91\u2013115 (1998)","journal-title":"Theoretical Computer Science A"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/3-540-45749-6_44","volume-title":"Algorithms - ESA 2002","author":"T. Fahle","year":"2002","unstructured":"Fahle, T.: Simple and fast: Improving a branch-and-bound algorithm for maximum clique. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 485\u2013498. Springer, Heidelberg (2002)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1999","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 189\u2013203. Springer, Heidelberg (1999)"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computing and System Science\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computing and System Science"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"26_CR18","first-page":"415","volume":"26","author":"J. Ne\u0161et\u0159il","year":"1985","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae\u00a026, 415\u2013419 (1985)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"4","key":"26_CR19","first-page":"424","volume":"8","author":"P.R.J. \u00d6stegard","year":"2001","unstructured":"\u00d6stegard, P.R.J.: A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing\u00a08(4), 424\u2013436 (2001)","journal-title":"Nordic Journal of Computing"},{"key":"26_CR20","unstructured":"\u00d6stegard, P.R.J.: Private communication (2004)"},{"key":"26_CR21","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. Journal of Global Optim.\u00a04, 301\u2013328 (1994)","journal-title":"Journal of Global Optim."},{"key":"26_CR23","first-page":"411","volume-title":"Encyclopedia of Optimization","author":"M. Pelillo","year":"2001","unstructured":"Pelillo, M.: Heuristics for maximum clique and independent set. In: Floudas, Pardalos (eds.) Encyclopedia of Optimization, vol.\u00a02, pp. 411\u2013423. Kluwer Academic, Dordrecht (2001)"},{"key":"26_CR24","unstructured":"Regin, J.-C.: Solving the maximum clique problem with constraint programming. In: Fifth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2003)"},{"key":"26_CR25","unstructured":"Robson, J.M.: Finding a maximum independent set in time O(2\n                              n\/4). Technical Report 1251-01, LaBRI, Universit\u00e9 Bordeaux I (2001)"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Shor, N.Z.: Dual quadratic estimates in polynomial and Boolean programming. In: Pardalos, Rosen (eds.) Computational Methods in Global Optimization. Ann. Oper. Res., vol.\u00a025, pp. 163\u2013168 (1990)","DOI":"10.1007\/BF02283692"},{"key":"26_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"D.R. Wood","year":"1997","unstructured":"Wood, D.R.: An algorithm for finding maximum cliques in a graph. Operations Research Letters\u00a021, 211\u2013217 (1997)","journal-title":"Operations Research Letters"},{"key":"26_CR28","unstructured":"Xue, J.: Fast Algorithms For Vertex Packing and Related Problems. Ph.D. Thesis, GSIA, Carnegie Mellon University (1991)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775096_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:40Z","timestamp":1619507680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775096_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351573","9783540351580"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11775096_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}