{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:12Z","timestamp":1771036332925,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319419190","type":"print"},{"value":"9783319419206","type":"electronic"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41920-6_45","type":"book-chapter","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T01:11:43Z","timestamp":1466989903000},"page":"569-583","source":"Crossref","is-referenced-by-count":3,"title":["Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound"],"prefix":"10.1007","author":[{"given":"Yoshiaki","family":"Okubo","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[]},{"given":"Etsuji","family":"Tomita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"45_CR1","unstructured":"Batagelj, V., Zaversnik, M.: An O(m) Algorithm for Cores Decomposition of Networks. CoRR 2003, cs.DS\/0310049 OpenURL"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"45_CR3","doi-asserted-by":"crossref","unstructured":"Ito, H., Iwama, K.: Enumeration of Isolated Cliques and Pseudo-Cliques. ACM Transactions on Algorithms 5(4), Article 40 (2009)","DOI":"10.1145\/1597036.1597044"},{"issue":"38\u201340","key":"45_CR4","doi-asserted-by":"crossref","first-page":"3640","DOI":"10.1016\/j.tcs.2009.04.021","volume":"410","author":"C Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., H\u00fcffner, F., Moser, H., Niedermeier, R.: Isolation Concepts for Efficiently Enuerating Dense Subgraphs. Theoretical Computer Science 410(38\u201340), 3640\u20133654 (2009)","journal-title":"Theoretical Computer Science"},{"key":"45_CR5","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection (2014). http:\/\/snap.stanford.edu\/data"},{"issue":"7","key":"45_CR6","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell, D., Kleinberg, J.M.: The Link-Prediction Problem for Social Networks. Journal of the Association for Information Science and Technology 58(7), 1019\u20131031 (2007)","journal-title":"Journal of the Association for Information Science and Technology"},{"issue":"4","key":"45_CR7","doi-asserted-by":"crossref","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. Statistics and Computing 17(4), 395\u2013416 (2007)","journal-title":"Statistics and Computing"},{"issue":"3","key":"45_CR8","doi-asserted-by":"crossref","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. Physical Review E. 74(3), 036104 (2006)","journal-title":"Physical Review E."},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"45_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-1-4614-0857-4_5","volume":"58","author":"J Pattillo","year":"2012","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: Clique Relaxation Models in Social Network Analysis. Handbook of Optimization in Complex Networks: Communication and Social Networks, Springer Optimization and Its Applications 58, 143\u2013162 (2012)","journal-title":"Handbook of Optimization in Complex Networks: Communication and Social Networks, Springer Optimization and Its Applications"},{"key":"45_CR11","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)"},{"key":"45_CR12","unstructured":"Scott, J.P., Carrington, P.J. (eds.): The SAGE Handbook of Social Network Analysis (2011)"},{"issue":"3","key":"45_CR13","doi-asserted-by":"crossref","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. Social Networks 5(3), 269\u2013287 (1983)","journal-title":"Social Networks"},{"issue":"1","key":"45_CR14","doi-asserted-by":"crossref","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. Journal of Mathematical Sociology 6(1), 139\u2013154 (1978)","journal-title":"Journal of Mathematical Sociology"},{"issue":"1","key":"45_CR15","doi-asserted-by":"crossref","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. Theoretical Computer Science 363(1), 28\u201342 (2006)","journal-title":"Theoretical Computer Science"},{"key":"45_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-319-31753-3_34","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Zhai","year":"2016","unstructured":"Zhai, H., Haraguchi, M., Okubo, Y., Tomita, E.: A fast and complete enumeration of pseudo-cliques for large graphs. In: Khan, L., et al. (eds.) PAKDD 2016. LNCS, vol. 9651, pp. 423\u2013435. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-31753-3_34"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41920-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:13:04Z","timestamp":1498324384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41920-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319419190","9783319419206"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41920-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}