{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T12:31:49Z","timestamp":1725971509902},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319763477"},{"type":"electronic","value":"9783319763484"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-76348-4_72","type":"book-chapter","created":{"date-parts":[[2018,3,21]],"date-time":"2018-03-21T15:10:42Z","timestamp":1521645042000},"page":"745-754","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Finding Maximal and Maximum Cliques: A Survey"],"prefix":"10.1007","author":[{"given":"Faten","family":"Fakhfakh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Tounsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Mosbah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Hadj Kacem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,22]]},"reference":[{"key":"72_CR1","unstructured":"Abu-Khzam, F.N., Baldwin, N.E., Langston, M.A., Samatova, N.F.: On the relative efficiency of maximal clique enumeration algorithms, with applications to high-throughput computational biology. In: Research Trends in Science and Technology (2005)"},{"key":"72_CR2","unstructured":"Berry, N., Ko, T., Moy, T., Smrcka, J., Turnley, J., Wu, B.: Emergent clique formation in terrorist recruitment. In: Agent Organizations: Theory and Practice (2004)"},{"issue":"1","key":"72_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1186\/1471-2105-10-205","volume":"10","author":"T Matsunaga","year":"2009","unstructured":"Matsunaga, T., Yonemori, C., Tomita, E., Muramatsu, M.: Clique-based data mining for related genes in a biomedical database. BMC Bioinform. 10(1), 205 (2009)","journal-title":"BMC Bioinform."},{"issue":"2","key":"72_CR4","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/s11227-009-0299-0","volume":"53","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Zhao, H., Cai, W., Liu, J., Zhou, W.: Using the k-core decomposition to analyze the static structure of large-scale software systems. J. Supercomput. 53(2), 352\u2013369 (2010)","journal-title":"J. Supercomput."},{"key":"72_CR5","doi-asserted-by":"crossref","unstructured":"Sun, S., Wang, Y., Liao, W., Wang, W.: Mining maximal cliques on dynamic graphs efficiently by local strategies. In: Proceedings of the 33rd International Conference on Data Engineering (ICDE), pp. 115\u2013118. IEEE (2017)","DOI":"10.1109\/ICDE.2017.53"},{"issue":"01","key":"72_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218488515500014","volume":"23","author":"A Rezvanian","year":"2015","unstructured":"Rezvanian, A., Meybodi, M.R.: Finding maximum clique in stochastic graphs using distributed learning automata. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 23(01), 1\u201331 (2015)","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"72_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, H., Li, C.M., Manya, F.: An exact algorithm for the maximum weight clique problem in large graphs. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI), pp. 830\u2013838 (2017)","DOI":"10.1609\/aaai.v31i1.10648"},{"issue":"4","key":"72_CR8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s41019-017-0033-5","volume":"1","author":"B Hou","year":"2016","unstructured":"Hou, B., Wang, Z., Chen, Q., Suo, B., Fang, C., Li, Z., Ives, Z.G.: Efficient maximal clique enumeration over graph data. Data Sci. Eng. 1(4), 219\u2013230 (2016)","journal-title":"Data Sci. Eng."},{"issue":"2","key":"72_CR9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/s11227-010-0458-3","volume":"59","author":"M Fazlali","year":"2012","unstructured":"Fazlali, M., Zakerolhosseini, A., Gaydadjiev, G.: Efficient datapath merging for the overhead reduction of run-time reconfigurable systems. J. Supercomput. 59(2), 636\u2013657 (2012)","journal-title":"J. Supercomput."},{"issue":"1","key":"72_CR10","first-page":"89","volume":"20","author":"A Kuz","year":"2016","unstructured":"Kuz, A., Falco, M., Giandini, R.: Social network analysis: a practical case study. Computaci\u00f3n y Sistemas 20(1), 89\u2013106 (2016)","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"72_CR11","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Proceedings of the International Symposium on Algorithms and Computation (ISAAC), Jeju Island, Korea, 15\u201317 December 2010, pp. 403\u2013414. Springer, Heidelberg","DOI":"10.1007\/978-3-642-17517-6_36"},{"issue":"2004","key":"72_CR12","first-page":"1","volume":"33","author":"B Kitchenham","year":"2004","unstructured":"Kitchenham, B.: Procedures for performing systematic reviews. Keele, UK, Keele University 33(2004), 1\u201326 (2004)","journal-title":"Keele, UK, Keele University"},{"key":"72_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.cor.2015.07.013","volume":"66","author":"PS Segundo","year":"2016","unstructured":"Segundo, P.S., Lopez, A., Pardalos, P.M.: A new exact maximum clique algorithm for large and massive sparse graphs. Comput. Oper. Res. 66, 81\u201394 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"72_CR14","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"PS Segundo","year":"2011","unstructured":"Segundo, P.S., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571\u2013581 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"72_CR15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"MC Schmidt","year":"2009","unstructured":"Schmidt, M.C., Samatova, N.F., Thomas, K., Park, B.H.: A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distrib. Comput. 69(4), 417\u2013428 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"72_CR16","unstructured":"Conte, A., Virgilio, R.D., Maccioni, A., Patrignani, M., Torlone, R.: Finding all maximal cliques in very large social networks. In: Proceedings of the 19th International Conference on Extending Database Technology (EDBT), pp. 173\u2013184 (2016)"},{"key":"72_CR17","doi-asserted-by":"crossref","unstructured":"Wu, B., Yang, S., Zhao, H., Wang, B.: A distributed algorithm to enumerate all maximal cliques in mapreduce. In: Proceedings of the Fourth International Conference on Frontier of Computer Science and Technology (FCST), pp. 45\u201351. IEEE (2009)","DOI":"10.1109\/FCST.2009.30"},{"issue":"3","key":"72_CR18","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1109\/TKDE.2016.2527643","volume":"29","author":"AP Mukherjee","year":"2017","unstructured":"Mukherjee, A.P., Xu, P., Tirthapura, S.: Enumeration of maximal cliques from an uncertain graph. IEEE Trans. Knowl. Data Eng. 29(3), 543\u2013555 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"72_CR19","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.dam.2017.01.026","volume":"223","author":"S Shimizu","year":"2017","unstructured":"Shimizu, S., Yamaguchi, K., Saitoh, T., Masuda, S.: Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound. Discret. Appl. Math. 223, 120\u2013134 (2017)","journal-title":"Discret. Appl. Math."},{"key":"72_CR20","doi-asserted-by":"crossref","unstructured":"Luo, C., Yu, J., Yu, D., Cheng, X.: Distributed algorithms for maximum clique in wireless networks. In: Proceedings of the 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN), pp. 222\u2013226 (2015)","DOI":"10.1109\/MSN.2015.37"},{"issue":"1","key":"72_CR21","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/TSC.2015.2479225","volume":"9","author":"Y Xu","year":"2016","unstructured":"Xu, Y., Cheng, J., Fu, A.W.C.: Distributed maximal clique computation and management. IEEE Trans. Serv. Comput. 9(1), 110\u2013122 (2016)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"72_CR22","unstructured":"Das, A., Svendsen, M., Tirthapura, S.: Change-sensitive algorithms for maintaining maximal cliques in a dynamic graph. arXiv preprint arXiv:1601.06311 (2016)"},{"key":"72_CR23","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Fu, A.W.C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks. ACM Trans. Database Syst. (TODS) 36(4), 21 (2011)","DOI":"10.1145\/2043652.2043654"},{"issue":"9","key":"72_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"72_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139168724","volume-title":"Introduction to Distributed Algorithms","author":"G Tel","year":"2000","unstructured":"Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge (2000)"},{"key":"72_CR26","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Rozenberg, G., Kreowski, H.J.: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 3. World Scientific, River Edge (1999)","DOI":"10.1142\/4181"},{"key":"72_CR27","doi-asserted-by":"crossref","unstructured":"Leavens, G.T., Abrial, J.R., Batory, D., Butler, M., Coglio, A., Fisler, K., Hehner, E., Jones, C., Miller, D., Peyton-Jones, S., Sitaraman, M., Smith, D.R., Stump, A.: Roadmap for enhanced languages and methods to aid verification. In: Proceedings of the 5th International Conference on Generative Programming and Component Engineering (GPCE), pp. 221\u2013236. ACM (2006)","DOI":"10.1145\/1173706.1173740"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Systems Design and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-76348-4_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T18:32:06Z","timestamp":1693593126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-76348-4_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319763477","9783319763484"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-76348-4_72","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018]]}}}