{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:38:13Z","timestamp":1725831493205},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319242811"},{"type":"electronic","value":"9783319242828"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24282-8_28","type":"book-chapter","created":{"date-parts":[[2015,10,3]],"date-time":"2015-10-03T21:18:36Z","timestamp":1443907116000},"page":"324-339","source":"Crossref","is-referenced-by-count":1,"title":["Enumerating Maximal Clique Sets with Pseudo-Clique Constraint"],"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":[[2015,11,25]]},"reference":[{"issue":"7307","key":"28_CR1","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"YY Ahn","year":"2010","unstructured":"Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761\u2013764 (2010)","journal-title":"Nature"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"3","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. Soci. 3, 3\u2013113 (1973)","journal-title":"J. Math. Soci."},{"key":"28_CR3","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets (2006). \n                    http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2003","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) algorithm for cores decomposition of networks. Adv. Data Anal. Classif. 5, 129\u2013145 (2003)","journal-title":"Adv. Data Anal. Classif."},{"issue":"9","key":"28_CR5","doi-asserted-by":"publisher","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":"28_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811395","volume-title":"Models and Methods in Social Network Analysis","author":"PJ Carrington","year":"2005","unstructured":"Carrington, P.J., Scott, J., Wasserman, S.: Models and Methods in Social Network Analysis, vol. 28. Cambridge University Press, New York (2005)"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1074\/mcp.M600381-MCP200","volume":"6","author":"SR Collins","year":"2007","unstructured":"Collins, S.R., Kemmeren, P., Zhao, X.C., Greenblatt, J.F., Spencer, F., Holstege, F.C., Weissman, J.S., Krogan, N.J.: Toward a comprehensive atlas of the physical interactome of saccharomyces cerevisiae. Mol. Cell. Proteomics 6(3), 439\u2013450 (2007)","journal-title":"Mol. Cell. Proteomics"},{"key":"28_CR8","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)"},{"issue":"12","key":"28_CR9","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Nat. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"10","key":"28_CR10","doi-asserted-by":"publisher","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","volume":"12","author":"S Gregory","year":"2010","unstructured":"Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010)","journal-title":"New J. Phys."},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/S0021-9800(68)80055-9","volume":"5","author":"RC Hamelink","year":"1968","unstructured":"Hamelink, R.C.: A partial characterization of clique graphs. J. Comb. Theor. 5(2), 192\u2013197 (1968)","journal-title":"J. Comb. Theor."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11605126_4","volume-title":"Federation over the Web","author":"M Haraguchi","year":"2006","unstructured":"Haraguchi, M., Okubo, Y.: A method for pinpoint clustering of web pages with pseudo-clique search. In: Jantke, K.P., Lunzer, A., Spyratos, N., Tanaka, Y. (eds.) Federation over the Web. LNCS (LNAI), vol. 3847, pp. 59\u201378. Springer, Heidelberg (2006)"},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"e18961","DOI":"10.1371\/journal.pone.0018961","volume":"6","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PloS one 6(4), e18961 (2011)","journal-title":"PloS one"},{"key":"28_CR14","unstructured":"Lee, C., Reid, F., McDaid, A., Hurley, N.: Detecting highly overlapping community structure by greedy clique expansion. In: Proceedings of the 4th Workshop on Social Network Mining and Analysis held in Conjunction with the International Conference on Knowledge Discovery and Data Mining (SNA\/KDD 2010), pp. 33\u201342 (2010)"},{"key":"28_CR15","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection, June 2014. \n                    http:\/\/snap.stanford.edu\/data"},{"issue":"2","key":"28_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02289199","volume":"15","author":"RD Luce","year":"1950","unstructured":"Luce, R.D.: Connectivity and generalized cliques in sociometric group structure. Psychometrika 15(2), 169\u2013190 (1950)","journal-title":"Psychometrika"},{"issue":"1","key":"28_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10878-010-9338-2","volume":"23","author":"B McClosky","year":"2012","unstructured":"McClosky, B., Hicks, I.V.: Combinatorial algorithms for the maximum k-plex problem. J. Comb. Optim. 23(1), 29\u201349 (2012)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken, R.: Cliques, clubs and clans. Qual. Quant. Int. J. Methodol. 13(2), 161\u2013173 (1979)","journal-title":"Qual. Quant. Int. J. Methodol."},{"issue":"1","key":"28_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"ER Omiecinski","year":"2003","unstructured":"Omiecinski, E.R.: Alternative interest measures for mining associations in databases. IEEE Trans. Knowl. Data Eng. 15(1), 57\u201369 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-1-4614-0857-4_5","volume-title":"Handbook of Optimization in Complex 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, pp. 143\u2013162. Springer, New York (2012)"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1093\/nar\/gkn1005","volume":"37","author":"S Pu","year":"2009","unstructured":"Pu, S., Wong, J., Turner, B., Cho, E., Wodak, S.J.: Up-to-date catalogues of yeast protein complexes. Nucleic Acids Res. 37(3), 825\u2013831 (2009)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"28_CR22","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. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"issue":"03","key":"28_CR23","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(03), 387\u2013402 (2014)","journal-title":"Netw. Sci."},{"issue":"1","key":"28_CR24","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. Theoret. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11533719_45","volume-title":"Computing and Combinatorics","author":"F Viger","year":"2005","unstructured":"Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 440\u2013449. Springer, Heidelberg (2005)"},{"issue":"6684","key":"28_CR26","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"},{"key":"28_CR27","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)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24282-8_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:41:20Z","timestamp":1559274080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24282-8_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319242811","9783319242828"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24282-8_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}