{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:02:03Z","timestamp":1760608923953,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T00:00:00Z","timestamp":1458345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T00:00:00Z","timestamp":1458345600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0103"],"award-info":[{"award-number":["FA9550-12-1-0103"]}],"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":["FA8651-12-2-0011"],"award-info":[{"award-number":["FA8651-12-2-0011"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0002051"],"award-info":[{"award-number":["DE-SC0002051"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10479-016-2161-0","type":"journal-article","created":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T13:59:20Z","timestamp":1458395960000},"page":"109-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Detecting robust cliques in graphs subject to uncertain edge failures"],"prefix":"10.1007","volume":"262","author":[{"given":"Oleksandra","family":"Yezerska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir L.","family":"Boginski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,19]]},"reference":[{"key":"2161_CR1","first-page":"119","volume":"50","author":"J Abello","year":"1999","unstructured":"Abello, J., Pardalos, P. M., & Resende, M. G. C. (1999). On maximum clique problems in very large graphs. DIMACS Series, 50, 119\u2013130.","journal-title":"DIMACS Series"},{"key":"2161_CR2","doi-asserted-by":"publisher","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":"2161_CR3","doi-asserted-by":"crossref","unstructured":"Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999). The maximum clique problem. In Handbook of Combinatorial Optimization, (pp. 1\u201374). Springer, New York.","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"1","key":"2161_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko, S., & Wilhelm, W. E. (2006). Clique-detection models in computational biochemistry and genomics. European Journal of Operational Research, 173(1), 1\u201317.","journal-title":"European Journal of Operational Research"},{"key":"2161_CR5","doi-asserted-by":"publisher","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":"2161_CR6","doi-asserted-by":"crossref","unstructured":"Corno, F., Prinetto, P., & Sonza\u00a0Reorda, M. (1995). Using symbolic techniques to find the maximum clique in very large sparse graphs. In Proceedings of the 1995 European conference on Design and Test, EDTC \u201995, (pp. 320\u2013324), Washington, DC, USA, 1995. IEEE Computer Society.","DOI":"10.1109\/EDTC.1995.470377"},{"key":"2161_CR7","doi-asserted-by":"crossref","unstructured":"Deane, C. M., Salwi\u0144ski, L., Xenarios, I., & Eisenberg, D. (2002). Protein interactions: two methods for assessment of the reliability of high throughput observations. Molecular & Cellular Proteomics, 1(5), 349\u2013356.","DOI":"10.1074\/mcp.M100037-MCP200"},{"key":"2161_CR8","doi-asserted-by":"crossref","unstructured":"Deng, M., Sun, F., & Chen, T. (2002). Assessment of the reliability of protein\u2013protein interactions and protein function prediction. In Pacific Symposium on Biocomputing (PSB 2003), (pp. 140\u2013151), 2002.","DOI":"10.1142\/9789812776303_0014"},{"key":"2161_CR9","unstructured":"DIMACS. NP Hard Problems: Maximum Clique, Graph Coloring, and Satisfiability. The Second DIMACS Implementation Challenge. \n                    http:\/\/dimacs.rutgers.edu\/Challenges\/\n                    \n                  , 1992\u20131993."},{"key":"2161_CR10","unstructured":"DIMACS. Algorithm Implementation Challenge: Graph Partitioning and Graph Clustering. The Tenth DIMACS Implementation Challenge. \n                    http:\/\/dimacs.rutgers.edu\/Challenges\/\n                    \n                  , 2012."},{"key":"2161_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T. A., & Resende, M. G. C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"2161_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"2161_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486(3), 75\u2013174.","journal-title":"Physics Reports"},{"key":"2161_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C Friden","year":"1989","unstructured":"Friden, C., Hertz, A., & de Werra, D. (1989). STABULUS: A technique for finding stable sets in large graphs with tabu search. Computing, 42, 35\u201344.","journal-title":"Computing"},{"key":"2161_CR15","doi-asserted-by":"publisher","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. Annals of Operations Research, 41, 385\u2013403.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"2161_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13(5), 533\u2013549.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2161_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F. (1989). Tabu search. Part I. ORSA Journal on Computing, 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"2161_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F. (1990). Tabu search. Part II. ORSA Journal on Computing, 2(1), 4\u201332.","journal-title":"ORSA Journal on Computing"},{"issue":"8","key":"2161_CR19","doi-asserted-by":"publisher","first-page":"4372","DOI":"10.1073\/pnas.0735871100","volume":"100","author":"DS Goldberg","year":"2003","unstructured":"Goldberg, D. S., & Roth, F. P. (2003). Assessing experimentally derived interactions in a small world. Proceedings of the National Academy of Sciences, 100(8), 4372\u20134376.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2161_CR20","unstructured":"Hintsanen, P. (2007). The most reliable subgraph problem. In Knowledge Discovery in Databases: PKDD 2007, (pp. 471\u2013478). Springer, 2007."},{"issue":"1","key":"2161_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P Hintsanen","year":"2008","unstructured":"Hintsanen, P., & Toivonen, H. (2008). Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery, 17(1), 3\u201323.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2161_CR22","doi-asserted-by":"crossref","unstructured":"Jin, R., Liu, L., & Aggarwal, C. (2011). Discovering highly reliable subgraphs in uncertain graphs. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, (pp. 992\u20131000). ACM, 2011.","DOI":"10.1145\/2020408.2020569"},{"issue":"2","key":"2161_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TKDE.2011.243","volume":"25","author":"G Kollios","year":"2013","unstructured":"Kollios, G., Potamias, M., & Terzi, E. (2013). Clustering large probabilistic graphs. IEEE Transactions on Knowledge and Data Engineering, 25(2), 325\u2013336.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2161_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-1-4757-3758-5_9","volume-title":"Cooperative Control: Models, Applications and Algorithms, volume 1 of Cooperative Systems","author":"P Krokhmal","year":"2003","unstructured":"Krokhmal, P., Murphey, R., Pardalos, P. M., Uryasev, S., & Zrazhevski, G. (2003). Robust decision making: Addressing uncertainties in distributions. In S. Butenko, R. Murphey, & P. M. Pardalos (Eds.), Cooperative Control: Models, Applications and Algorithms, volume 1 of Cooperative Systems (pp. 165\u2013185). New York: Springer."},{"issue":"Suppl 1","key":"2161_CR25","doi-asserted-by":"publisher","first-page":"S3","DOI":"10.1186\/1471-2164-11-S1-S3","volume":"11","author":"X Li","year":"2010","unstructured":"Li, X., Wu, M., Kwoh, C.-K., & Ng, S.-K. (2010). Computational approaches for detecting protein complexes from protein interaction networks: a survey. BMC Genomics, 11(Suppl 1), S3.","journal-title":"BMC Genomics"},{"key":"2161_CR26","doi-asserted-by":"crossref","unstructured":"Liu, L., Jin, R., Aggarwal, C., & Shen, Y. (2012). Reliable clustering on uncertain graphs. In ICDM, (pp. 459\u2013468). Citeseer, 2012.","DOI":"10.1109\/ICDM.2012.11"},{"key":"2161_CR27","doi-asserted-by":"publisher","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":"2161_CR28","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10878-013-9699-4","volume":"28","author":"Z Miao","year":"2014","unstructured":"Miao, Z., Balasundaram, B., & Pasiliao, E. L. (2014). An exact algorithm for the maximum probabilistic clique problem. Journal of Combinatorial Optimization, 28, 105\u2013120.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2161_CR29","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \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":"2161_CR30","first-page":"11","volume":"2","author":"J Palmquist","year":"2002","unstructured":"Palmquist, J., Krohmal, P., & Uryasev, S. (2002). Portfolio optimization with conditional value-at-risk objective and constraints. The Journal of Risk, 2, 11\u201327.","journal-title":"The Journal of Risk"},{"key":"2161_CR31","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Youssef, N., & Butenko, S. (2013). On clique relaxation models in network analysis. European Journal of Operational Research, 226, 9\u201318.","journal-title":"European Journal of Operational Research"},{"key":"2161_CR32","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R. T., & Uryasev, S. (2000). Optimization of conditional value-at-risk. The Journal of Risk, 2, 21\u201342.","journal-title":"The Journal of Risk"},{"issue":"7","key":"2161_CR33","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1016\/S0378-4266(02)00271-6","volume":"26","author":"RT Rockafellar","year":"2002","unstructured":"Rockafellar, R. T., & Uryasev, S. (2002). Conditional value-at-risk for general loss distributions. Journal of Banking and Finance, 26(7), 1443\u20131471.","journal-title":"Journal of Banking and Finance"},{"issue":"1","key":"2161_CR34","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10878-014-9718-0","volume":"28","author":"M Rysz","year":"2014","unstructured":"Rysz, M., Mirghorbani, M., Krokhmal, P., & Pasiliao, E. L. (2014). On risk-averse maximum weighted subgraph problems. Journal of Combinatorial Optimization, 28(1), 167\u2013185.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2161_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S. B., & Foster, B. L. (1978). A graph theoretic generalization of the clique concept. Journal of Mathematical Sociology, 6, 139\u2013154.","journal-title":"Journal of Mathematical Sociology"},{"key":"2161_CR36","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02125454","volume":"63","author":"P Soriano","year":"1996","unstructured":"Soriano, P., & Gendreau, M. (1996). Diversification strategies in tabu search algorithms for the maximum clique problem. Annals of Operations Research, 63, 189\u2013207.","journal-title":"Annals of Operations Research"},{"issue":"21","key":"2161_CR37","doi-asserted-by":"publisher","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, 100(21), 12123\u201312128.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2161_CR38","first-page":"278","volume-title":"Discrete mathematics and theoretical computer science, volume 2731 of lecture notes in computer science","author":"E Tomita","year":"2003","unstructured":"Tomita, E., & Seki, T. (2003). An efficient branch-and-bound algorithm for finding a maximum clique. In C. Calude, M. Dinneen, & V. Vajnovszki (Eds.), Discrete mathematics and theoretical computer science, volume 2731 of lecture notes in computer science (pp. 278\u2013289). Berlin: Springer."},{"key":"2161_CR39","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.2014.0618","volume":"27","author":"A Verma","year":"2015","unstructured":"Verma, A., Buchanan, A., & Butenko, S. (2015). Solving the maximum clique and vertex coloring problems on very large sparse networks. INFORMS Journal on Computing, 27, 164\u2013177.","journal-title":"INFORMS Journal on Computing"},{"key":"2161_CR40","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s10878-011-9437-8","volume":"26","author":"Q Wu","year":"2013","unstructured":"Wu, Q., & Hao, J. K. (2013). An adaptive multistart tabu search approach to solve the maximum clique problem. Journal of Combinatorial Optimization, 26, 86\u2013108.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"2161_CR41","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., & Hao, J. K. (2015). A review on algorithms for maximum clique problems. European Journal of Operational Research, 242(3), 693\u2013709.","journal-title":"European Journal of Operational Research"},{"key":"2161_CR42","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s10479-012-1124-3","volume":"196","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J. K., & Glover, F. (2012). Multi-neighborhood tabu search for the maximum weight clique problem. Annals of Operations Research, 196, 611\u2013634.","journal-title":"Annals of Operations Research"},{"key":"2161_CR43","doi-asserted-by":"crossref","unstructured":"Yannakakis, M. (1978). Node-and edge-deletion np-complete problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978.","DOI":"10.1145\/800133.804355"},{"key":"2161_CR44","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1093\/bioinformatics\/btl014","volume":"22","author":"H Yu","year":"2006","unstructured":"Yu, H., Paccanaro, A., Trifonov, V., & Gerstein, M. (2006). Predicting interactions in protein networks by completing defective cliques. Bioinformatics, 22, 823\u2013829.","journal-title":"Bioinformatics"},{"key":"2161_CR45","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., & Zhang, S. (2010). Finding top-$$k$$ maximal cliques in an uncertain graph. In Proceedings of the 26th IEEE International Conference on Data Engineering (ICDE), (pp. 649\u2013652). IEEE, 2010.","DOI":"10.1109\/ICDE.2010.5447891"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2161-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2161-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2161-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2161-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:37:35Z","timestamp":1589729855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2161-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,19]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["2161"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2161-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2016,3,19]]},"assertion":[{"value":"19 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}