{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:06:57Z","timestamp":1775815617267,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,18]],"date-time":"2008-10-18T00:00:00Z","timestamp":1224288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s00453-008-9238-3","type":"journal-article","created":{"date-parts":[[2008,10,17]],"date-time":"2008-10-17T12:20:41Z","timestamp":1224246041000},"page":"3-16","source":"Crossref","is-referenced-by-count":64,"title":["An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem"],"prefix":"10.1007","volume":"56","author":[{"given":"Takeaki","family":"Uno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,18]]},"reference":[{"key":"9238_CR1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307\u2013328. MIT Press, Cambridge (1996)"},{"key":"9238_CR2","first-page":"51","volume-title":"Symposium on Discrete Algorithms (SODA)","author":"J. Aslam","year":"1999","unstructured":"Aslam, J., Pelekhov, K., Rus, D.: A practical clustering algorithms for static and dynamic information organization. In: Symposium on Discrete Algorithms (SODA), vol. 99, pp. 51\u201360. Assoc. Comput. Mach., New York (1999)"},{"key":"9238_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. In: Proceedings of ACM Symposium on Theory of Computing, pp. 284\u2013293 (1995)","DOI":"10.1145\/225058.225140"},{"key":"9238_CR4","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: Proceedings of SDM 2002 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"9238_CR5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9238_CR6","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"9238_CR7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/net.3230220504","volume":"22","author":"K. Fukuda","year":"1992","unstructured":"Fukuda, K., Matsui, T.: Finding all minimum-cost perfect matchings in bipartite graphs. Networks 22, 461\u2013468 (1992)","journal-title":"Networks"},{"key":"9238_CR8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-46846-3_14","volume":"1721","author":"K. Fujisawa","year":"1999","unstructured":"Fujisawa, K., Hamuro, Y., Katoh, N., Tokuyama, T., Yada, K.: Approximation of optimal two-dimensional association rules for categorical attributes using semidefinite programming. Lect. Notes Comput. Sci. 1721, 148\u2013159 (1999)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9238_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"9238_CR10","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems, In: Proceedings of ACM Symposium on Theory of Computing, pp. 47\u201363 (1974)","DOI":"10.1145\/800119.803884"},{"key":"9238_CR11","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proceedings of Very Large Data Bases Conference, pp. 721\u2013732 (2005)"},{"key":"9238_CR12","first-page":"59","volume":"3847","author":"M. Haraguchi","year":"2006","unstructured":"Haraguchi, M., Okubo, Y.: A method for clustering of web pages with pseudo-clique search. Lect. Notes Artif. Intell. 3847, 59\u201378 (2006)","journal-title":"Lect. Notes Artif. Intell."},{"key":"9238_CR13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H. Hu","year":"2005","unstructured":"Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.J.: Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21, 213\u2013221 (2005)","journal-title":"Bioinformatics"},{"key":"9238_CR14","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Extracting large-scale knowledge bases from the Web. In: Proceedings of Very Large Data Bases Conference, pp. 639\u2013650 (1999)"},{"key":"9238_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, S.R., Raphavan, P., Rajagopalan, S., Tomkins, A.: Trawling the Web for emerging cyber communities. In: Proceedings of 8th International WWW Conference, pp. 1481\u20131493 (1999)","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"9238_CR16","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-27810-8_23","volume":"3111","author":"K. Makino","year":"2004","unstructured":"Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. Lect. Notes Comput. Sci. 3111, 260\u2013272 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9238_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-540-30559-0_3","volume":"3353","author":"S. Nakano","year":"2004","unstructured":"Nakano, S., Uno, T.: Constant time generation of trees with specified diameter. Lect. Notes Comput. Sci. 3353, 33\u201345 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"7043","key":"9238_CR18","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"key":"9238_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.1975.5.3.237","volume":"5","author":"R.C. Read","year":"1975","unstructured":"Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"9238_CR20","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. Theor. Comput. Sci. 363, 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9238_CR21","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumeration algorithms. National Institute of Informatics (in Japan) Technical Report, 004E (2003)"},{"key":"9238_CR22","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/978-3-540-77120-3_36","volume":"4835","author":"T. Uno","year":"2007","unstructured":"Uno, T.: An efficient algorithm for enumerating pseudo cliques. Lect. Notes Comput. Sci. 4835, 402\u2013414 (2007)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9238_CR23","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Proceedings of IEEE ICDM\u201904 Workshop FIMI\u201904. Available at http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/\/Vol-126\/ (2004)"},{"key":"9238_CR24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1108\/07378830310479794","volume":"21","author":"S. Warner","year":"2003","unstructured":"Warner, S.: E-prints and the open archives initiative. Libr. Hi Tech 21, 151\u2013158 (2003)","journal-title":"Libr. Hi Tech"},{"key":"9238_CR25","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/1046456.1046461","volume":"6","author":"Y. Zhang","year":"2004","unstructured":"Zhang, Y., Chu, C.H., Ji, X., Zha, H.: Correlating summarization of multisource news with k way graph biclustering. SIGKDD Explor. 6, 34\u201342 (2004)","journal-title":"SIGKDD Explor."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9238-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9238-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9238-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:03Z","timestamp":1559123103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9238-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,18]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9238"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9238-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,18]]}}}