{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:15:49Z","timestamp":1776122149795,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T00:00:00Z","timestamp":1352851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10479-012-1242-y","type":"journal-article","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T13:38:22Z","timestamp":1352813902000},"page":"145-161","source":"Crossref","is-referenced-by-count":34,"title":["A branch-and-bound approach for maximum quasi-cliques"],"prefix":"10.1007","volume":"216","author":[{"given":"Foad","family":"Mahdavi Pajouh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuqi","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balabhaskar","family":"Balasundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,14]]},"reference":[{"key":"1242_CR1","series-title":"DIMACS series on discrete mathematics and theoretical computer science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1090\/dimacs\/050\/06","volume-title":"External memory algorithms and visualization","author":"J. Abello","year":"1999","unstructured":"Abello, J., Pardalos, P. M., & Resende, M. G. C. (1999). On maximum clique problems in very large graphs. In J. Abello & J. Vitter (Eds.), DIMACS series on discrete mathematics and theoretical computer science: Vol.\u00a050. External memory algorithms and visualization (pp. 119\u2013130). Providence: American Mathematical Society."},{"key":"1242_CR2","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: proceedings of the 5th Latin American symposium on theoretical informatics","author":"J. Abello","year":"2002","unstructured":"Abello, J., Resende, M. G. C., & Sudarsky, S. (2002). Massive quasi-clique detection. In S. Rajsbaum (Ed.), LATIN 2002: proceedings of the 5th Latin American symposium on theoretical informatics (pp. 598\u2013612). London: Springer."},{"key":"1242_CR3","doi-asserted-by":"crossref","first-page":"2115a","DOI":"10.1126\/science.287.5461.2115a","volume":"287","author":"L. Adamic","year":"2000","unstructured":"Adamic, L., & Huberman, B. (2000). Power-law distribution of the World Wide Web. Science, 287, 2115a.","journal-title":"Science"},{"issue":"1","key":"1242_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"R. D. Alba","year":"1973","unstructured":"Alba, R. D. (1973). A graph-theoretic definition of a sociometric clique. The Journal of Mathematical Sociology, 3(1), 113\u2013126.","journal-title":"The Journal of Mathematical Sociology"},{"key":"1242_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/0-387-33916-7_1","volume-title":"Power laws, scale-free networks and genome biology","author":"E. Almaas","year":"2006","unstructured":"Almaas, E., & Barab\u00e1si, A. L. (2006). Power laws in biological networks. In E. Koonin, Y. I. Wolf, & G. P. Karev (Eds.), Power laws, scale-free networks and genome biology (pp. 1\u201311). New York: Springer."},{"issue":"1","key":"1242_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B. Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., & Trukhanov, S. (2005). Novel approaches for analyzing biological networks. Journal of Combinatorial Optimization, 10(1), 23\u201339.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"1242_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B. Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., & Hicks, I. V. (2011). Clique relaxations in social network analysis: the maximum k-plex problem. Operations Research, 59(1), 133\u2013142.","journal-title":"Operations Research"},{"issue":"5439","key":"1242_CR8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A. L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A. L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509\u2013512.","journal-title":"Science"},{"issue":"1\u20134","key":"1242_CR9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0378-4371(00)00018-2","volume":"281","author":"A. L. Barab\u00e1si","year":"2000","unstructured":"Barab\u00e1si, A. L., Albert, R., & Jeong, H. (2000). Scale-free characteristics of random networks: the topology of the World Wide Web. Physica. A, 281(1\u20134), 69\u201377.","journal-title":"Physica. A"},{"key":"1242_CR10","unstructured":"Batagelj, V., & Mrvar, A. (2006). Pajek datasets: Reuters terror news network. Online: http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/CRA\/terror.htm . Accessed March 2008."},{"key":"1242_CR11","volume-title":"Innovation in financial and economic networks","author":"V. Boginski","year":"2003","unstructured":"Boginski, V., Butenko, S., & Pardalos, P. M. (2003). On structural properties of the market graph. In A.\u00a0Nagurney (Ed.), Innovation in financial and economic networks. London: Edward Elgar."},{"key":"1242_CR12","doi-asserted-by":"crossref","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V. Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., & Pardalos, P. (2006). Mining market data: a network approach. Computers & Operations Research, 33, 3171\u20133184.","journal-title":"Computers & Operations Research"},{"key":"1242_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of combinatorial optimization","author":"I. M. Bomze","year":"1999","unstructured":"Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999). The maximum clique problem. In D. Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization (pp. 1\u201374). Dordrecht: Kluwer Academic."},{"key":"1242_CR14","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1117\/12.434393","volume-title":"Scalability and traffic control in IP networks","author":"A. Broido","year":"2001","unstructured":"Broido, A., & Claffy, K. C. (2001). Internet topology: connectivity of IP graphs. In S. Fahmy & K. Park (Eds.), Scalability and traffic control in IP networks (pp. 172\u2013187). Bellingham: SPIE."},{"key":"1242_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-92695-5_4","volume-title":"Learning and intelligent optimization","author":"M. Brunato","year":"2008","unstructured":"Brunato, M., Hoos, H., & Battiti, R. (2008). On effectively finding maximal quasi-cliques in graphs. In V.\u00a0Maniezzo, R. Battiti, & J. P. Watson (Eds.), Lecture notes in computer science: Vol.\u00a05313. Learning and intelligent optimization (pp. 41\u201355). Berlin: Springer."},{"issue":"9","key":"1242_CR16","doi-asserted-by":"crossref","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D. Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., & Chen, R. (2003). Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Research, 31(9), 2443\u20132450.","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"1242_CR17","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1103\/PhysRevE.60.1412","volume":"60","author":"J. M. Carlson","year":"1999","unstructured":"Carlson, J. M., & Doyle, J. (1999). Highly optimized tolerance: a mechanism for power laws in designed systems. Physical Review E, 60(2), 1412\u20131427.","journal-title":"Physical Review E"},{"key":"1242_CR18","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, P. (1990). An exact algorithm for the maximum clique problem. Operations Research Letters, 9, 375\u2013382.","journal-title":"Operations Research Letters"},{"key":"1242_CR19","series-title":"CBMS lecture series","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/107","volume-title":"Complex graphs and networks","author":"F. Chung","year":"2006","unstructured":"Chung, F., & Lu, L. (2006). CBMS lecture series. Complex graphs and networks. Providence: American Mathematical Society."},{"issue":"2","key":"1242_CR20","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D. J. Cook","year":"2000","unstructured":"Cook, D. J., & Holder, L. B. (2000). Graph-based data mining. IEEE Intelligent Systems, 15(2), 32\u201341.","journal-title":"IEEE Intelligent Systems"},{"issue":"2","key":"1242_CR21","first-page":"157","volume":"28","author":"S. Corman","year":"2002","unstructured":"Corman, S., Kuhn, T., McPhee, R., & Dooley, K. (2002). Studying complex discursive systems: centering resonance analysis of organizational communication. Human Communication Research, 28(2), 157\u2013206.","journal-title":"Human Communication Research"},{"key":"1242_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"D. Corneil","year":"1984","unstructured":"Corneil, D., & Perl, Y. (1984). Clustering and domination in perfect graphs. Discrete Applied Mathematics, 9, 27\u201339.","journal-title":"Discrete Applied Mathematics"},{"key":"1242_CR23","unstructured":"Dimacs (1995). Cliques, coloring, and satisfiability: second Dimacs implementation challenge. Online: http:\/\/dimacs.rutgers.edu\/Challenges\/ . Accessed March 2007."},{"key":"1242_CR24","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., & R\u00e9nyi, A. (1959). On random graphs. Publicationes Mathematicae, 6, 290\u2013297.","journal-title":"Publicationes Mathematicae"},{"key":"1242_CR25","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316188.316229","volume-title":"Proceedings of the ACM-SIGCOMM conference on applications, technologies, architectures, and protocols for computer communication","author":"M. Faloutsos","year":"1999","unstructured":"Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999). 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 (pp. 251\u2013262)."},{"key":"1242_CR26","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., & Peleg, D. (2001). The dense k-subgraph problem. Algorithmica, 29, 410\u2013421.","journal-title":"Algorithmica"},{"issue":"8","key":"1242_CR27","doi-asserted-by":"crossref","DOI":"10.1186\/gb-2004-5-8-r57","volume":"5","author":"J. Gagneur","year":"2004","unstructured":"Gagneur, J., Krause, R., Bouwmeester, T., & Casari, G. (2004). Modular decomposition of protein-protein interaction networks. Genome Biology, 5(8), R57.","journal-title":"Genome Biology"},{"issue":"12","key":"1242_CR28","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M. Girvan","year":"2002","unstructured":"Girvan, M., & Newman, M. E. J. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 99(12), 7821\u20137826.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"1242_CR29","unstructured":"Grossman, J., Ion, P., & Castro, R. D. (1995). The Erd\u00f6s number project. Online: http:\/\/www.oakland.edu\/enp\/ . Accessed March 2007."},{"key":"1242_CR30","unstructured":"IBM Corporation (2010). IBM ILOG CPLEX Optimizer 12.2. http:\/\/www.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/ . IBM Academic Initiative. Accessed June 2011."},{"issue":"8","key":"1242_CR31","doi-asserted-by":"crossref","first-page":"4569","DOI":"10.1073\/pnas.061034498","volume":"98","author":"T. Ito","year":"2001","unstructured":"Ito, T., Chiba, T., Ozawa, R., Yoshida, M., Hattori, M., & Sakaki, Y. (2001). A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proceedings of the National Academy of Sciences of the United States of America, 98(8), 4569\u20134574.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"4","key":"1242_CR32","doi-asserted-by":"crossref","DOI":"10.1145\/1460797.1460799","volume":"2","author":"D. Jiang","year":"2009","unstructured":"Jiang, D., & Pei, J. (2009). Mining frequent cross-graph quasi-cliques. ACM Transactions on Knowledge Discovery from Data, 2(4), 16.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"1242_CR33","first-page":"692","volume-title":"Proceedings of the 34th annual IEEE symposium on foundations of computer science","author":"G. Kortsarz","year":"1993","unstructured":"Kortsarz, G., & Peleg, D. (1993). On choosing a dense subgraph. In Proceedings of the 34th annual IEEE symposium on foundations of computer science (pp. 692\u2013701). Piscataway: IEEE Comput. Soc."},{"key":"1242_CR34","volume-title":"Combinatorial algorithms: generation, enumeration, and search","author":"D. L. Kreher","year":"1998","unstructured":"Kreher, D. L., & Stinson, D. R. (1998). Combinatorial algorithms: generation, enumeration, and search (1st ed.). Boca Raton: CRC Press.","edition":"1"},{"key":"1242_CR35","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1145\/1367497.1367620","volume-title":"Proceeding of the 17th international conference on World Wide Web. WWW \u201908","author":"J. Leskovec","year":"2008","unstructured":"Leskovec, J., & Horvitz, E. (2008). Planetary-scale views on a large instant-messaging network. In Proceeding of the 17th international conference on World Wide Web. WWW \u201908 (pp. 915\u2013924). New York: ACM."},{"issue":"16","key":"1242_CR36","doi-asserted-by":"crossref","first-page":"4804","DOI":"10.1093\/nar\/gkh814","volume":"32","author":"H. Lu","year":"2004","unstructured":"Lu, H., Zhu, X., Liu, H., Skogerb, G., Zhang, J., Zhang, Y., Cai, L., Zhao, Y., Sun, S., Xu, J., Bu, D., & Chen, R. (2004). The interactome as a tree\u2014an attempt to visualize the protein-protein interaction network in yeast. Nucleic Acids Research, 32(16), 4804\u20134811.","journal-title":"Nucleic Acids Research"},{"issue":"2","key":"1242_CR37","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"R. D. Luce","year":"1950","unstructured":"Luce, R. D. (1950). Connectivity and generalized cliques in sociometric group structure. Psychometrika, 15(2), 169\u2013190.","journal-title":"Psychometrika"},{"issue":"2","key":"1242_CR38","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R. J. Mokken","year":"1979","unstructured":"Mokken, R. J. (1979). Cliques, clubs and clans. Quality and Quantity, 13(2), 161\u2013173.","journal-title":"Quality and Quantity"},{"key":"1242_CR39","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P. R. J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P. R. J. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120, 197\u2013207.","journal-title":"Discrete Applied Mathematics"},{"key":"1242_CR40","author":"J. Patillo","year":"2012","unstructured":"Patillo, J., Veremyev, A., Butenko, S., & Boginski, V. (2012). On the maximum quasi-clique problem. Discrete Applied Mathematics. doi: 10.1016\/j.dam.2012.07.019 .","journal-title":"Discrete Applied Mathematics"},{"key":"1242_CR41","first-page":"353","volume-title":"Proceedings of the 21st international conference on data engineering. ICDE 2005","author":"J. Pei","year":"2005","unstructured":"Pei, J., Jiang, D., & Zhang, A. (2005a). Mining cross-graph quasi-cliques in gene expression and protein interaction data. In Proceedings of the 21st international conference on data engineering. ICDE 2005 (pp. 353\u2013356)."},{"key":"1242_CR42","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/1081870.1081898","volume-title":"Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining. KDD \u201905","author":"J. Pei","year":"2005","unstructured":"Pei, J., Jiang, D., & Zhang, A. (2005b). On mining cross-graph quasi-cliques. In Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining. KDD \u201905 (pp.\u00a0228\u2013238). New York: ACM."},{"key":"1242_CR43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-0-387-34569-7_7","volume-title":"Methods of microarray data analysis V","author":"X. Peng","year":"2007","unstructured":"Peng, X., Langston, M. A., Saxton, A. M., Baldwin, N. E., & Snoddy, J. R. (2007). Detecting network motifs in gene co-expression networks through integration of protein domain information. In P. McConnell, S. M. Lin, & P. Hurban (Eds.), Methods of microarray data analysis V (pp. 89\u2013102). New York: Springer."},{"key":"1242_CR44","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"S. B. Seidman","year":"1978","unstructured":"Seidman, S. B., & Foster, B. L. (1978). A graph theoretic generalization of the clique concept. The Journal of Mathematical Sociology, 6, 139\u2013154.","journal-title":"The Journal of Mathematical Sociology"},{"key":"1242_CR45","unstructured":"Simonite, T. (2011). Bracing for the data deluge. http:\/\/www.technologyreview.com\/business\/37506\/ . Accessed May 2011."},{"issue":"21","key":"1242_CR46","doi-asserted-by":"crossref","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V. Spirin","year":"2003","unstructured":"Spirin, V., & Mirny, L. A. (2003). Protein complexes and functional modules in molecular networks. Proceedings of the National Academy of Sciences of the United States of America, 100(21), 12123\u201312128.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"1","key":"1242_CR47","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. ACM SIGKDD Explorations Newsletter, 5(1), 59\u201368.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"1242_CR48","volume-title":"Introduction to graph theory","author":"D. West","year":"2001","unstructured":"West, D. (2001). Introduction to graph theory. Upper Saddle River: Prentice-Hall."},{"key":"1242_CR49","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/1150402.1150506","volume-title":"Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201906","author":"Z. Zeng","year":"2006","unstructured":"Zeng, Z., Wang, J., Zhou, L., & Karypis, G. (2006). Coherent closed quasi-clique discovery from large dense graph databases. In Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201906 (pp. 797\u2013802). New York: ACM."},{"key":"1242_CR50","doi-asserted-by":"crossref","DOI":"10.1145\/1242524.1242530","volume":"32","author":"Z. Zeng","year":"2007","unstructured":"Zeng, Z., Wang, J., Zhou, L., & Karypis, G. (2007). Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Transactions on Database Systems, 32, 13.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1242-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1242-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1242-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T19:33:42Z","timestamp":1687808022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1242-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,14]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["1242"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1242-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,14]]}}}