{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:31:26Z","timestamp":1742394686192,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_13","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"119-130","source":"Crossref","is-referenced-by-count":15,"title":["Linear-Time Enumeration of Isolated Cliques"],"prefix":"10.1007","author":[{"given":"Hiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Osumi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00453-001-0088-5","volume":"32","author":"J. Abello","year":"2002","unstructured":"Abello, J., Buchsbaum, A.L., Westbrook, J.R.: A functional approach to external graph algorithms. Algorithmica\u00a032, 437\u2013458 (2002)","journal-title":"Algorithmica"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Karger, D.R., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 284\u2013293 (1995)","DOI":"10.1145\/225058.225140"},{"issue":"1-3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y. Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraph. Discrete Applied Mathematics\u00a0121(1-3), 15\u201326 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y. Asahiro","year":"2000","unstructured":"Asahiro, Y., Iwama, K., Tamaki, H., Tokuyama, T.: Greedily finding a dense subgraph. J. Algorithms\u00a034, 203\u2013221 (2000)","journal-title":"J. Algorithms"},{"key":"13_CR5","volume-title":"Handbook of Combinatorial Optimization (Supple. vol. A)","author":"I. Bomze","year":"1999","unstructured":"Bomze, I.: The Maximum Clique Problem. In: Handbook of Combinatorial Optimization (Supple. vol. A). Kluwer, Dordrecht (1999)"},{"issue":"1,2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R. Downey","year":"1995","unstructured":"Downey, R., Fellows, M.: Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Theor. Comput. Sci.\u00a0141(1,2), 109\u2013131 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parametrized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parametrized Complexity. Springer, Heidelberg (1999)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1145\/347090.347121","volume-title":"Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD-2000)","author":"G.W. Flake","year":"2000","unstructured":"Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD-2000), pp. 150\u2013160. ACM Press, Boston (2000)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Gibson, D., Kleinberg, J.M., Raghavan, P.: Inferring web communities from link topology. In: UK Conference on Hypertext, pp. 225\u2013234 (1998)","DOI":"10.1145\/276627.276652"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"He, X., Zha, H., Ding, C., Simon, H.: Web document clustering using hyperlink structures, Tech. Rep. CSE-01-006, Department of Computer Science and Engineering, Pennsylvania State University (2001)","DOI":"10.2172\/815474"},{"key":"13_CR12","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","year":"1996","unstructured":"Johnson, D., Trick, M. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. American Mathematical Society, Providence (1996)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Peleg, D.: On choosing a dense subgraph. In: Proceedings of the 34th Annual IEEE Symposium on Foundation of Computer Science, pp. 692\u2013701 (1993)","DOI":"10.1109\/SFCS.1993.366818"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J. Moon","year":"1965","unstructured":"Moon, J., Moser, L.: On cliques in graphs. Israel Journal of Mathematics\u00a03, 23\u201328 (1965)","journal-title":"Israel Journal of Mathematics"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Reddy, P.K., Kitsuregawa, M.: An approach to relate the web communities through bipartite graphs. In: Proceedings of The Second International Conference on Web Information Systems Engineering, pp. 301\u2013310 (2001)","DOI":"10.1109\/WISE.2001.996491"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1137\/0403025","volume":"3","author":"H.U. Simon","year":"1990","unstructured":"Simon, H.U.: On approximate solutions for combinatorial optimization problems. SIAM J. Disc. Math.\u00a03, 294\u2013310 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"13_CR17","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.\u00a03111, pp. 260\u2013272. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T20:09:26Z","timestamp":1736021366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11561071_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}