{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:03:07Z","timestamp":1743116587687,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319317526"},{"type":"electronic","value":"9783319317533"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-31753-3_34","type":"book-chapter","created":{"date-parts":[[2016,4,11]],"date-time":"2016-04-11T09:06:43Z","timestamp":1460365603000},"page":"423-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs"],"prefix":"10.1007","author":[{"given":"Hongjie","family":"Zhai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Okubo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Etsuji","family":"Tomita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,12]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Berlowitz, D., Cohen, S., Kimelfeld, B.: Efficient enumeration of maximal \n                      \n                        \n                      \n                      $$k$$\n                    -Plexes. In: Proceedings of the 2015 ACM SIGMOD Conference, pp. 431\u2013444 (2015)","DOI":"10.1145\/2723372.2746478"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"DR Luce","year":"1950","unstructured":"Luce, D.R.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2), 169\u2013190 (1950)","journal-title":"Psychometrika"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1973.9989826","volume":"3","author":"RD Alba","year":"1973","unstructured":"Alba, R.D.: A graph-theoretic definition of a sociometric clique. J. Math. Soc. 3(1), 113\u2013126 (1973)","journal-title":"J. Math. Soc."},{"issue":"2","key":"34_CR4","first-page":"161","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken, R.: Cliques, clubs and clans, quality & quantity. Int. J. Meth. 13(2), 161\u2013173 (1979)","journal-title":"Int. J. Meth."},{"issue":"6684","key":"34_CR5","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"1","key":"34_CR6","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.: A graph-theoretic generalization of the clique concept. J. Math. Soc. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Soc."},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 598\u2013612. Springer, Heidelberg (2002)"},{"issue":"4","key":"34_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg","year":"2007","unstructured":"Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"issue":"3","key":"34_CR9","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)","journal-title":"Phys. Rev. E"},{"volume-title":"The SAGE Handbook of Social Network Analysis","year":"2011","key":"34_CR10","unstructured":"Scott, J.P., Carrington, P.J. (eds.): The SAGE Handbook of Social Network Analysis. Sage Publications, London (2011)"},{"key":"34_CR11","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-1-4614-0857-4_5","volume-title":"Handbook of Optimization in Complex Networks: Communication and Social Networks","author":"J Pattillo","year":"2012","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: Clique relaxation models in social network analysis. In: Thai, M.T., Pardalos, P.M. (eds.) Handbook of Optimization in Complex Networks: Communication and Social Networks. Springer Optimization and Its Applications, vol. 58, pp. 143\u2013162. Springer, New York (2012)"},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 364\u2013375. Springer, Heidelberg (2011)"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-540-77018-3_47","volume-title":"Emerging Technologies in Knowledge Discovery and Data Mining","author":"B Wu","year":"2007","unstructured":"Wu, B., Pei, X.: A parallel algorithm for enumerating all the maximal k-Plexes. In: Washio, T., Zhou, Z.-H., Huang, J.Z., Hu, X., Li, J., Xie, C., He, J., Zou, D., Li, K.-C., Freire, M.M. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4819, pp. 476\u2013483. Springer, Heidelberg (2007)"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-33492-4_23","volume-title":"Discovery Science","author":"Y Okubo","year":"2012","unstructured":"Okubo, Y., Haraguchi, M., Tomita, E.: Structural change pattern mining based on constrained maximal k-Plex search. In: Ganascia, J.-G., Lenca, P., Petit, J.-M. (eds.) DS 2012. LNCS, vol. 7569, pp. 284\u2013298. Springer, Heidelberg (2012)"},{"key":"34_CR17","unstructured":"Rymon, R.: Search through systematic set enumeration. In: Proceedings of International Conference on Principles of Knowledge Representation Reasoning - KR 1992, pp. 539\u2013550 (1992)"},{"issue":"3","key":"34_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1017\/nws.2014.22","volume":"2","author":"N Slater","year":"2014","unstructured":"Slater, N., Itzchack, R., Louzoun, Y.: Mid size cliques are more common in real world networks than triangles. Netw. Sci. 2(3), 387\u2013402 (2014)","journal-title":"Netw. Sci."},{"key":"34_CR19","unstructured":"Batagelj, V. and Zaversnik, M.: An \n                      \n                        \n                      \n                      $$O(m)$$\n                     algorithm for cores decomposition of networks. In: CoRR 2003, cs.DS\/0310049 OpenURL"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"34_CR21","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection (2014). \n                      http:\/\/snap.stanford.edu\/data"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31753-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T19:53:48Z","timestamp":1559418828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31753-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319317526","9783319317533"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31753-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"12 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}