{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T04:16:38Z","timestamp":1749010598562,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319398167"},{"type":"electronic","value":"9783319398174"}],"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-39817-4_27","type":"book-chapter","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T13:15:09Z","timestamp":1464268509000},"page":"279-288","source":"Crossref","is-referenced-by-count":0,"title":["Finding Disjoint Dense Clubs in an Undirected Graph"],"prefix":"10.1007","author":[{"given":"Peng","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunlin","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wencheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-1-4419-6045-0_10","volume-title":"Managing and Mining Graph Data","author":"VE Lee","year":"2010","unstructured":"Lee, V.E., Ruan, N., Jin, R., Aggarwal, C.: A survey of algorithms for dense subgraph discover. In: Aggarwal, C.C., Wang, H. (eds.) Managing and Mining Graph Data, pp. 303\u2013336. Springer, New York (2010)"},{"issue":"1","key":"27_CR2","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 a the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, New York (1972)"},{"issue":"3","key":"27_CR4","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 maximal clique problem. J. Glob. Optim. 4(3), 301\u2013328 (1994)","journal-title":"J. Glob. Optim."},{"key":"27_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Springer, New York (1999)"},{"issue":"3","key":"27_CR6","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.: A review on algorithms for maximum clique problem. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"27_CR7","doi-asserted-by":"crossref","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. Sociol. 3(1), 113\u2013126 (1973)","journal-title":"J. Math. Sociol."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken, R.J.: Clique clubs and clans. Qual. Quant. 13, 161\u2013173 (1979)","journal-title":"Qual. Quant."},{"key":"27_CR9","first-page":"026113","volume":"E69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E69, 026113 (2004)","journal-title":"Phys. Rev."},{"key":"27_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4614-8588-9_10","volume-title":"Models, Algorithms and Technologies for Network Analysis","author":"S Shahinpour","year":"2013","unstructured":"Shahinpour, S., Butenko, S.: Distance-based clique relaxations in networks: $$s$$ -Clique and s-Club. In: Goldengorin, B.I., Kalyagin, V.A., Pardalos, P.M. (eds.) Models, Algorithms and Technologies for Network Analysis, pp. 149\u2013174. Springer, New York (2013)"},{"doi-asserted-by":"crossref","unstructured":"Hastad, J.: Clique is hard to approximate with in $$n^{1-\\epsilon }$$ . In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 627\u2013636. IEEE (1996)","key":"27_CR11","DOI":"10.1109\/SFCS.1996.548522"},{"issue":"1","key":"27_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, B., Trukhanov, S.: Novel approaches for analyzing biological networks. J. Comb. Optim. 10(1), 23\u201329 (2005)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"27_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J Bourjolly","year":"2002","unstructured":"Bourjolly, J., Laporte, G., Pesant, G.: An exact algorithm for the maximum $$k$$ -club problem in an undirected graph. Eur. J. Oper. Res. 138(1), 21\u201328 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.disopt.2012.02.002","volume":"9","author":"FM Pajouh","year":"2012","unstructured":"Pajouh, F.M., Balasundaram, B.: On inclusionwise maximal and maximum cardinality $$k$$ -clubs in graphs. Discrete Optim. 9, 84\u201397 (2012)","journal-title":"Discrete Optim."},{"issue":"6","key":"27_CR15","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0305-0548(99)00047-7","volume":"27","author":"J Bourjolly","year":"2000","unstructured":"Bourjolly, J., Laporte, G., Pesant, G.: Heuristics for finding $$k$$ -clubs in an undirected graph. Comput. Oper. Res. 27(6), 559\u2013569 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"27_CR16","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s00607-012-0263-3","volume":"95","author":"M Chang","year":"2013","unstructured":"Chang, M., Hung, L.: Finding large $$k$$ -clubs in undirected graphs. Computing 95(9), 739\u2013758 (2013)","journal-title":"Computing"},{"issue":"5","key":"27_CR17","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","volume":"6","author":"A Schaefer","year":"2012","unstructured":"Schaefer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5), 883\u2013891 (2012)","journal-title":"Optim. Lett."},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-3-642-33293-7_22","volume-title":"Parameterized and Exact Computation","author":"S Hartung","year":"2012","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A.: Parameterized algorithmics and computational experiments for finding 2-clubs. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 231\u2013241. Springer, Heidelberg (2012)"},{"issue":"8","key":"27_CR19","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H Bodlaender","year":"2009","unstructured":"Bodlaender, H., Downey, R., Fellows, M., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Bodlaender, H., Thomasse, S., Yeo, A.: Analysis of data reduction: transformations give evidence for non-existence of polynomial kernels. Technical report UU-CS\u2013030, Dept. of Info. and Comput. Sciences, Utrecht University (2008)","key":"27_CR20"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-29700-7_22","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"H Liu","year":"2012","unstructured":"Liu, H., Zhang, P., Zhu, D.: On editing graphs into 2-club clusters. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol. 7285, pp. 235\u2013246. Springer, Heidelberg (2012)"},{"key":"27_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"27_CR23","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"27_CR24","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39817-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:37:24Z","timestamp":1748979444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39817-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319398167","9783319398174"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39817-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}