{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:17:15Z","timestamp":1773886635745,"version":"3.50.1"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319539249","type":"print"},{"value":"9783319539256","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_1","type":"book-chapter","created":{"date-parts":[[2017,2,20]],"date-time":"2017-02-20T01:12:36Z","timestamp":1487553156000},"page":"3-15","source":"Crossref","is-referenced-by-count":31,"title":["Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications"],"prefix":"10.1007","author":[{"given":"Etsuji","family":"Tomita","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1093\/ietfec\/e89-a.5.1215","volume":"E89\u2013A","author":"T Akutsu","year":"2006","unstructured":"Akutsu, T., Hayashida, M., Bahadur, D.K.C., Tomita, E., Suzuki, J., Horimoto, K.: Dynamic programming and clique based approaches for protein threading with profiles and constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E89\u2013A, 1215\u20131222 (2006)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18, 525\u2013547 (2012)","journal-title":"J. Heuristics"},{"key":"1_CR3","first-page":"143","volume":"13","author":"DKC Bahadur","year":"2002","unstructured":"Bahadur, D.K.C., Akutsu, T., Tomita, E., Seki, T., Fujiyama, A.: Point matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm. Genome Inf. 13, 143\u2013152 (2002)","journal-title":"Genome Inf."},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1142\/S0219720005000904","volume":"3","author":"DKC Bahadur","year":"2005","unstructured":"Bahadur, D.K.C., Tomita, E., Suzuki, J., Akutsu, T.: Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach. J. Bioinform. Comput. Biol. 3, 103\u2013126 (2005)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1142\/S0219720006001680","volume":"4","author":"DKC Bahadur","year":"2006","unstructured":"Bahadur, D.K.C., Tomita, E., Suzuki, J., Horimoto, K., Akutsu, T.: Protein threading with profiles and distance constraints using clique based algorithms. J. Bioinform. Comput. Biol. 4, 19\u201342 (2006)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10878-012-9592-6","volume":"27","author":"M Batsyn","year":"2014","unstructured":"Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27, 397\u2013416 (2014)","journal-title":"J. Comb. Optim."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Supplement vol. A, pp. 1\u201374. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"1_CR8","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, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"1_CR9","first-page":"3","volume":"17","author":"JB Brown","year":"2006","unstructured":"Brown, J.B., Bahadur, D.K.C., Tomita, E., Akutsu, T.: Multiple methods for protein side chain packing using maximum weight cliques. Genome Inf. 17, 3\u201312 (2006)","journal-title":"Genome Inf."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko, S., Wilhelm, W.E.: Clique-detection models in computational biochemistry and genomics - invited review-. Eur. J. Oper. Res. 173, 1\u201317 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9, 375\u2013382 (1990)","journal-title":"Oper. Res. Lett."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"3.1:1","DOI":"10.1145\/2543629","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. J. Exp. Algorithmics 18, 3.1:1\u20133.1:21 (2013)","journal-title":"J. Exp. Algorithmics"},{"key":"1_CR13","unstructured":"Fujii, T., Tomita, E.: On efficient algorithms for finding a maximum clique. Technical report IECE, AL81-113, pp. 25\u201334 (1982)"},{"issue":"S\u20131","key":"1_CR14","doi-asserted-by":"crossref","first-page":"S:13","DOI":"10.1186\/1471-2105-12-S1-S13","volume":"12","author":"D Fukagawa","year":"2011","unstructured":"Fukagawa, D., Tamura, T., Takasu, A., Tomita, E., Akutsu, T.: A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structure. BMC Bioinform. 12(S\u20131), S:13 (2011)","journal-title":"BMC Bioinform."},{"key":"1_CR15","unstructured":"Hatta, T., Tomita, E., Ito, H., Wakatsuki, M.: An improved branch-and-bound algorithm for finding a maximum clique. In: Proceedings of the Summer LA Symposium, no. 9, pp. 1\u20138 (2015)"},{"issue":"SIG14(TOM9)","key":"1_CR16","first-page":"57","volume":"44","author":"K Hotta","year":"2003","unstructured":"Hotta, K., Tomita, E., Takahashi, H.: A view-invariant human face detection method based on maximum cliques. Trans. IPSJ 44(SIG14(TOM9)), 57\u201370 (2003)","journal-title":"Trans. IPSJ"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026"},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Comlexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Comlexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"1_CR19","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2005.05.010","volume":"95","author":"K Katayama","year":"2005","unstructured":"Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95, 503\u2013511 (2005)","journal-title":"Inf. Process. Lett."},{"key":"1_CR20","unstructured":"Kobayashi, S., Kondo, T., Okuda, K., Tomita, E.: Extracting globally structure free sequences by local structure freeness. In: Chen, J., Reif, J. (eds.) Proceedings of Ninth International Meeting on DNA Based Computers, p. 206 (2003)"},{"key":"1_CR21","unstructured":"Kohata, Y., Nishijima, T., Tomita, E., Fujihashi, C., Takahashi, H.: Efficient algorithms for finding a maximum clique. Technical report IEICE, COM89-113, pp. 1\u20138 (1990)"},{"key":"1_CR22","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc, J., Jane\u017ei\u010d, D.: An improved branch and bound algorithm for the maximum clique problem. MATCH Commun. Math. Comput. Chem. 58, 569\u2013590 (2007)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Li, C.M., Quan, Z.: Combining graph structure exploitation and propositional reasoning for the maximum clique problem. In: Proceedings of IEEE ICTAI, pp. 344\u2013351 (2010)","DOI":"10.1109\/ICTAI.2010.57"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume-title":"Algorithm Theory - SWAT 2004","author":"K Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 260\u2013272. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-27810-8_23"},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-013-0075-9","volume":"59","author":"E Maslov","year":"2014","unstructured":"Maslov, E., Batsyn, M., Pardalos, P.M.: Speeding up branch and bound algorithms for solving the maximum clique problem. J. Glob. Optim. 59, 1\u201321 (2014)","journal-title":"J. Glob. Optim."},{"key":"1_CR26","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, 205 (2009)","journal-title":"BMC Bioinform."},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1089\/cmb.2012.0133","volume":"19","author":"T Mori","year":"2012","unstructured":"Mori, T., Tamura, T., Fukagawa, D., Takasu, A., Tomita, E., Akutsu, T.: A clique-based method using dynamic programming for computing edit distance between unordered trees. J. Comput. Biol. 19, 1089\u20131104 (2012)","journal-title":"J. Comput. Biol."},{"key":"1_CR29","unstructured":"Nagai, M., Tabuchi, T., Tomita, E., Takahashi, H.: An experimental evaluation of some algorithms for finding a maximum clique. In: Conference Records of the National Convention of IEICE 1988, p. D-348 (1988)"},{"key":"1_CR30","unstructured":"Nakui, Y., Nishino, T., Tomita, E., Nakamura, T.: On the minimization of the quantum circuit depth based on a maximum clique with maximum vertex weight. Technical report RIMS, 1325, Kyoto University, pp. 45\u201350 (2003)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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 (LNAI), vol. 7569, pp. 284\u2013298. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33492-4_23"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-44949-9_18","volume-title":"Multi-disciplinary Trends in Artificial Intelligence","author":"Y Okubo","year":"2013","unstructured":"Okubo, Y., Haraguchi, M., Tomita, E.: Relational change pattern mining based on modularity difference. In: Ramanna, S., Lingras, P., Sombattheera, C., Krishna, A. (eds.) MIWAI 2013. LNCS (LNAI), vol. 8271, pp. 187\u2013198. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-44949-9_18"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/978-3-319-41920-6_45","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"Y Okubo","year":"2016","unstructured":"Okubo, Y., Haraguchi, M., Tomita, E.: Enumerating maximal isolated cliques based on vertex-dependent connection lower bound. In: Perner, P. (ed.) MLDM 2016. LNCS (LNAI), vol. 9729, pp. 569\u2013583. Springer, Heidelberg (2016)"},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Glob. Optim. 4, 301\u2013328 (1994)","journal-title":"J. Glob. Optim."},{"key":"1_CR35","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"crossref","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, Heidelberg (2012)"},{"key":"1_CR36","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.cor.2015.06.009","volume":"64","author":"PS Segundo","year":"2015","unstructured":"Segundo, P.S., Nikolaev, A., Batsyn, M.: Infra-chromatic bound for exact maximum clique search. Comput. Oper. Res. 64, 293\u2013303 (2015)","journal-title":"Comput. Oper. Res."},{"key":"1_CR37","unstructured":"Shindo, M., Tomita, E., Maruyama, Y.: An efficient algorithm for finding a maximum clique. Technical report IECE, CAS86-5, pp. 33\u201340 (1986)"},{"key":"1_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/scj.4690210301","volume":"21","author":"M Shindo","year":"1990","unstructured":"Shindo, M., Tomita, E.: A simple algorithm for finding a maximum clique and its worst-case time complexity. Syst. Comput. Jpn. 21, 1\u201313 (1990). Wiley","journal-title":"Syst. Comput. Jpn."},{"key":"1_CR39","unstructured":"Sutani, Y., Higashi, T., Tomita, E., Takahashi, S., Nakatani, H.: A faster branch-and-bound algorithm for finding a maximum clique. Technical report IPSJ, 2006-AL-108, pp. 79\u201386 (2006)"},{"issue":"3","key":"1_CR40","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6(3), 537\u2013546 (1977)","journal-title":"SIAM J. Comput."},{"key":"1_CR41","unstructured":"Tomita, E., Yamada, M.: An algorithm for finding a maximum complete subgraph. In: Conference Records of the National Convention of IECE 1978, p. 8 (1978)"},{"key":"1_CR42","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for finding all the cliques. Technical report, University of Electro-Communications, UEC-TR-C5(2) (1988). (Reference [238] in [34], Reference [308] in [7]). http:\/\/id.nii.ac.jp\/1438\/00001898\/"},{"key":"1_CR43","unstructured":"Tomita, E., Kohata, Y., Takahashi, H.: A simple algorithm for finding a maximum clique. Technical report, University of Electro-Communications, UEC-TR-C5(1) (1988). (Reference [239] in [34], Reference [309] in [7]). http:\/\/id.nii.ac.jp\/1438\/00001899\/"},{"key":"1_CR44","unstructured":"Tomita, E., Mitsuma, S., Takahashi, H.: Two algorithms for finding a near-maximum clique. Technical report, University of Electro-Communications, UEC-TR-C1 (1988). (Reference [240] in [34], Reference [310] in [7]). http:\/\/id.nii.ac.jp\/1438\/00001900\/"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 278\u2013289. Springer, Heidelberg (2003)"},{"key":"1_CR46","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. Theoret. Comput. Sci. 363, 28\u201342 (2006). (Special Issue on COCOON 2004)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR47","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37, 95\u2013111 (2007). J. Glob. Optim. 44, 311 (2009)","journal-title":"J. Glob. Optim."},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-11440-3_18","volume-title":"WALCOM: Algorithms and Computation","author":"E Tomita","year":"2010","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 191\u2013203. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-11440-3_18"},{"key":"1_CR49","first-page":"625","volume-title":"Biomedical Engineering, Trends in Electronics, Communications and Software","author":"E Tomita","year":"2011","unstructured":"Tomita, E., Akutsu, T., Matsunaga, T.: Efficient algorithms for finding maximum and maximal cliques: Effective tools for bioinformatics. In: Laskovski, A.N. (ed.) Biomedical Engineering, Trends in Electronics, Communications and Software, pp. 625\u2013640. InTech, Rijeka (2011). http:\/\/cdn.intechopen.com\/pdfs-wm\/12929.pdf"},{"key":"1_CR50","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1587\/transinf.E96.D.1286","volume":"E96\u2013D","author":"E Tomita","year":"2013","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments. IEICE Trans. Inf. Syst. E96\u2013D, 1286\u20131298 (2013). http:\/\/id.nii.ac.jp\/1438\/00000287\/","journal-title":"IEICE Trans. Inf. Syst."},{"key":"1_CR51","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4939-2864-4_725","volume-title":"Encyclopedia of Algorithms","author":"E Tomita","year":"2016","unstructured":"Tomita, E.: Clique enumeration. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, 2nd edn, pp. 313\u2013317. Springer, Heidelberg (2016)","edition":"2"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-319-39817-4_21","volume-title":"Frontiers in Algorithmics","author":"E Tomita","year":"2016","unstructured":"Tomita, E., Yoshida, K., Hatta, T., Nagao, A., Ito, H., Wakatsuki, M.: A much faster branch-and-bound algorithm for finding a maximum clique. In: Zhu, D., Bereg, S. (eds.) FAW 2016. LNCS, vol. 9711, pp. 215\u2013226. Springer, Heidelberg (2016)"},{"key":"1_CR53","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"1_CR54","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.K.: A review on algorithms for maximum clique problems - invited review-. Eur. J. Oper. Res. 242, 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR55","first-page":"55","volume":"7","author":"C Yonemori","year":"2009","unstructured":"Yonemori, C., Matsunaga, T., Sekine, J., Tomita, E.: A structural analysis of enterprise relationship using cliques. DBSJ J. 7, 55\u201360 (2009)","journal-title":"DBSJ J."},{"key":"1_CR56","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-24282-8_28","volume-title":"Discovery Science","author":"H Zhai","year":"2015","unstructured":"Zhai, H., Haraguchi, M., Okubo, Y., Tomita, E.: Enumerating maximal clique sets with pseudo-clique constraint. In: Japkowicz, N., Matwin, S. (eds.) DS 2015. LNCS (LNAI), vol. 9356, pp. 324\u2013339. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-24282-8_28"},{"key":"1_CR57","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s41060-016-0022-1","volume":"2","author":"H Zhai","year":"2016","unstructured":"Zhai, H., Haraguchi, M., Okubo, Y., Tomita, E.: A fast and complete algorithm for enumerating pseudo-cliques in large graphs. Int. J. Data Sci. Anal. 2, 145\u2013158 (2016). Springer","journal-title":"Int. J. Data Sci. Anal."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T21:30:39Z","timestamp":1568842239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}