{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:13:03Z","timestamp":1784178783598,"version":"3.55.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-09-1-0056"],"award-info":[{"award-number":["HDTRA1-09-1-0056"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-09-1-0154"],"award-info":[{"award-number":["FA9550-09-1-0154"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-08-1-0483"],"award-info":[{"award-number":["FA9550-08-1-0483"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1016\/j.dam.2012.07.019","type":"journal-article","created":{"date-parts":[[2012,8,17]],"date-time":"2012-08-17T13:31:11Z","timestamp":1345210271000},"page":"244-257","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":99,"title":["On the maximum quasi-clique problem"],"prefix":"10.1016","volume":"161","author":[{"given":"Jeffrey","family":"Pattillo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Veremyev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Boginski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2012.07.019_br000005","series-title":"External Memory Algorithms and Visualization","first-page":"119","article-title":"On maximum clique problems in very large graphs","author":"Abello","year":"1999"},{"key":"10.1016\/j.dam.2012.07.019_br000010","series-title":"LATIN 2002: Theoretical Informatics","first-page":"598","article-title":"Massive quasi-clique detection","author":"Abello","year":"2002"},{"key":"10.1016\/j.dam.2012.07.019_br000015","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/10586458.2001.10504428","article-title":"A random graph model for power law graphs","volume":"10","author":"Aiello","year":"2001","journal-title":"Experimental Mathematics"},{"key":"10.1016\/j.dam.2012.07.019_br000020","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1137\/0122052","article-title":"Upper bounds on the order of a clique of a graph","volume":"22","author":"Amin","year":"1972","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/j.dam.2012.07.019_br000025","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","article-title":"Clique relaxations in social network analysis: the maximum k-plex problem","volume":"59","author":"Balasundaram","year":"2011","journal-title":"Operations Research"},{"key":"10.1016\/j.dam.2012.07.019_br000030","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","article-title":"Novel approaches for analyzing biological networks","volume":"10","author":"Balasundaram","year":"2005","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.dam.2012.07.019_br000035","series-title":"IEEE International Conference on Artificial Intelligence Systems","first-page":"194","article-title":"Mining the largest quasi-clique in human protein interactome","author":"Bhattacharyya","year":"2009"},{"key":"10.1016\/j.dam.2012.07.019_br000040","series-title":"Handbook of Combinatorial Optimization","first-page":"1","article-title":"The maximum clique problem","author":"Bomze","year":"1999"},{"key":"10.1016\/j.dam.2012.07.019_br000045","series-title":"Learning and Intelligent Optimization","first-page":"41","article-title":"On effectively finding maximal quasi-cliques in graphs","volume":"vol. 5313","author":"Brunato","year":"2008"},{"key":"10.1016\/j.dam.2012.07.019_br000050","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0166-218X(02)00386-4","article-title":"Exact bounds on the order of the maximum clique of a graph","volume":"127","author":"Budinich","year":"2003","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2012.07.019_br000055","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/15427951.2004.10129089","article-title":"The spectra of random graphs with given expected degrees","volume":"1","author":"Chung","year":"2004","journal-title":"Internet Mathematics"},{"key":"10.1016\/j.dam.2012.07.019_br000060","doi-asserted-by":"crossref","unstructured":"M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-law relationships of the internet topology, in: Proceedings of the ACM-SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Cambridge, MA, 1999, pp. 251\u2013262.","DOI":"10.1145\/316188.316229"},{"key":"10.1016\/j.dam.2012.07.019_br000065","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.dam.2012.07.019_br000070","doi-asserted-by":"crossref","first-page":"205","DOI":"10.2307\/2785673","article-title":"A procedure for clique detection using the group matrix","volume":"20","author":"Harary","year":"1957","journal-title":"Sociometry"},{"key":"10.1016\/j.dam.2012.07.019_br000075","series-title":"Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases\u2014Part II","first-page":"33","article-title":"Effective pruning techniques for mining quasi-cliques","author":"Liu","year":"2008"},{"key":"10.1016\/j.dam.2012.07.019_br000080","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","article-title":"Connectivity and generalized cliques in sociometric group structure","volume":"15","author":"Luce","year":"1950","journal-title":"Psychometrika"},{"key":"10.1016\/j.dam.2012.07.019_br000085","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","article-title":"A method of matrix analysis of group structure","volume":"14","author":"Luce","year":"1949","journal-title":"Psychometrika"},{"issue":"2","key":"10.1016\/j.dam.2012.07.019_br000090","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","article-title":"Classifying molecular sequences using a linkage graph with their pairwise similarities","volume":"210","author":"Matsuda","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.dam.2012.07.019_br000095","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00139635","article-title":"Cliques, clubs and clans","volume":"13","author":"Mokken","year":"1979","journal-title":"Quality and Quantity"},{"key":"10.1016\/j.dam.2012.07.019_br000100","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","article-title":"Maxima for graphs and a new proof of a theorem of Tur\u00e1n","volume":"17","author":"Motzkin","year":"1965","journal-title":"Canadian Journal of Mathematics"},{"key":"10.1016\/j.dam.2012.07.019_br000105","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Review"},{"key":"10.1016\/j.dam.2012.07.019_br000110","series-title":"Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD\u201905","first-page":"228","article-title":"On mining cross-graph quasi-cliques","author":"Pei","year":"2005"},{"key":"10.1016\/j.dam.2012.07.019_br000115","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","article-title":"A graph theoretic generalization of the clique concept","volume":"6","author":"Seidman","year":"1978","journal-title":"Journal of Mathematical Sociology"},{"key":"10.1016\/j.dam.2012.07.019_br000120","series-title":"Social Network Analysis","author":"Wasserman","year":"1994"},{"key":"10.1016\/j.dam.2012.07.019_br000125","doi-asserted-by":"crossref","unstructured":"Z. Zeng, J. Wang, L. Zhou, G. Karypis, Out-of-core coherent closed quasi-clique mining from large dense graph databases, ACM Transactions on Database System 32 (2007). Article 13. https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1145\/1242524.1242530.","DOI":"10.1145\/1242524.1242530"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X12002843?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X12002843?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:58:29Z","timestamp":1759060709000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X12002843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["S0166218X12002843"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2012.07.019","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2013,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the maximum quasi-clique problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2012.07.019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2012 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}