{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:56:39Z","timestamp":1773392199716,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,3]],"date-time":"2010-08-03T00:00:00Z","timestamp":1280793600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10878-010-9338-2","type":"journal-article","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T18:32:45Z","timestamp":1280773965000},"page":"29-49","source":"Crossref","is-referenced-by-count":50,"title":["Combinatorial algorithms for the maximum k-plex problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Benjamin","family":"McClosky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Illya V.","family":"Hicks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,3]]},"reference":[{"key":"9338_CR1","unstructured":"Applegate D, Johnson D (1993). dfmax.c. ftp:\/\/dimacs.rutgers.edu\/pub\/challange\/graph\/solvers\/"},{"key":"9338_CR2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01955041","volume":"15","author":"E Balas","year":"1996","unstructured":"Balas E, Xue J (1996) Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica 15:397\u2013412","journal-title":"Algorithmica"},{"key":"9338_CR3","doi-asserted-by":"crossref","unstructured":"Balasundaram B, Butenko S, Hicks IV (2010) Clique relaxations in social network analysis: The maximum k-plex problem. Oper Res (to appear)","DOI":"10.1287\/opre.1100.0851"},{"key":"9338_CR4","unstructured":"Batagelj V, Mrvar A (2006) Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"9338_CR5","unstructured":"Beebe NHF (2002) Nelson H.F. Beebe\u2019s bibliographies page"},{"key":"9338_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du D-Z, Pardalos PM (eds) Handbook of Combinatorial Optimization, vol\u00a0A. Kluwer Academic, Boston, pp\u00a01\u201374"},{"key":"9338_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251\u2013256","journal-title":"Commun ACM"},{"issue":"3","key":"9338_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1014899909753","volume":"6","author":"S Busygin","year":"2002","unstructured":"Busygin S, Butenko S, Pardalos PM (2002) A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. J Comb Optim 6(3):287\u2013297","journal-title":"J Comb Optim"},{"key":"9338_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko S, Wilhelm W (2006) Clique-detection models in computational biochemistry and genomics. Eur J\u00a0Oper Res 173:1\u201317","journal-title":"Eur J\u00a0Oper Res"},{"key":"9338_CR10","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375\u2013382","journal-title":"Oper Res Lett"},{"key":"9338_CR11","volume-title":"Ad hoc and sensor networks","author":"YP Chen","year":"2004","unstructured":"Chen YP, Liestman AL, Liu J (2004) Clustering algorithms for ad hoc wireless networks. In: Pan Y, Xiao Y (eds) Ad hoc and sensor networks. Nova Science Publishers, New York"},{"key":"9338_CR12","unstructured":"DIMACS (1995) Cliques, coloring, and satisfiability: second DIMACS implementation challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/ . Accessed 2006"},{"key":"9338_CR13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1177\/001872674900200205","volume":"10","author":"L Festinger","year":"1949","unstructured":"Festinger L (1949) The analysis of sociograms using matrix algebra. Hum Relat 10:153\u201358","journal-title":"Hum Relat"},{"key":"9338_CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1177\/0049124184012003001","volume":"12","author":"NE Friedkin","year":"1984","unstructured":"Friedkin NE (1984) Structural cohesion and equivalence explanations of social homogeneity. Sociol Methods Res 12:235\u2013261","journal-title":"Sociol Methods Res"},{"key":"9338_CR15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"M Gendreau","year":"1993","unstructured":"Gendreau M, Soriano P, Salvail L (1993) Solving the maximum clique problem using a tabu search approach. Ann Oper Res 41:385\u2013403","journal-title":"Ann Oper Res"},{"issue":"1","key":"9338_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.dam.2003.09.012","volume":"145","author":"P Hansen","year":"2004","unstructured":"Hansen P, Mladenovi N, Urosevi D (2004) Variable neighborhood search for the maximum clique. Discrete Appl Math 145(1):117\u2013125","journal-title":"Discrete Appl Math"},{"key":"9338_CR17","unstructured":"Jones B (2002) Computational geometry database"},{"key":"9338_CR18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"R Luce","year":"1949","unstructured":"Luce R, Perry A (1949) A method of matrix analysis of group structure. Psychometrika 14:95\u2013116","journal-title":"Psychometrika"},{"key":"9338_CR19","first-page":"112","volume-title":"Lecture notes in computer science","author":"E Marchiori","year":"2002","unstructured":"Marchiori E (2002) Genetic, iterated and multistart local search for the maximum clique problem. In: Lecture notes in computer science, vol 2279. Springer, Berlin, pp 112\u2013121"},{"key":"9338_CR20","unstructured":"McClosky B (2008) Independence systems and stable set relaxations. Ph.D. thesis, Computational and Applied Mathematics Department, Rice University, Houston, TX"},{"issue":"3","key":"9338_CR21","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1137\/070687414","volume":"23","author":"B McClosky","year":"2009","unstructured":"McClosky B, Hicks IV (2009) The co-2-plex polytope and integral systems. SIAM J\u00a0Discrete Math 23(3):1135\u20131148","journal-title":"SIAM J\u00a0Discrete Math"},{"key":"9338_CR22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon JW, Moser L (1965) On cliques in graphs. Isr J Math 3:23\u201328","journal-title":"Isr J Math"},{"key":"9338_CR23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd PRJ (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120:197\u2013207","journal-title":"Discrete Appl Math"},{"key":"9338_CR24","unstructured":"R\u00e9gin JC (2003). 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, pp\u00a0166\u2013179"},{"key":"9338_CR25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman SB, Foster BL (1978) A graph theoretic generalization of the clique concept. J\u00a0Math Soc 6:139\u2013154","journal-title":"J\u00a0Math Soc"},{"key":"9338_CR26","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/ijoc.10.4.438","volume":"10","author":"EC Sewell","year":"1998","unstructured":"Sewell EC (1998) A branch and bound algorithm for the stability number of a sparse graph. INFORMS J Comput 10:438\u2013447","journal-title":"INFORMS J Comput"},{"key":"9338_CR27","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume":"2731","author":"E Tomita","year":"2003","unstructured":"Tomita E, Seki T (2003) An efficient branch-and-bound algorithm for finding a maximum clique. Lect Not Comput Sci Ser 2731:278\u2013289","journal-title":"Lect Not Comput Sci Ser"},{"issue":"1","key":"9338_CR28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio T, Motoda H (2003) State of the art of graph-based data mining. SIGKDD Explor Newsl 5(1):59\u201368","journal-title":"SIGKDD Explor Newsl"},{"key":"9338_CR29","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge"},{"key":"9338_CR30","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"DR Wood","year":"1997","unstructured":"Wood DR (1997) An algorithm for finding a maximum clique in a graph. Oper Res Lett 21:211\u2013217","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9338-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9338-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9338-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:53:18Z","timestamp":1559361198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9338-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,3]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9338"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9338-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,3]]}}}