{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:38:54Z","timestamp":1769852334586,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223399","type":"print"},{"value":"9783540278108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_23","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T13:27:29Z","timestamp":1279027649000},"page":"260-272","source":"Crossref","is-referenced-by-count":210,"title":["New Algorithms for Enumerating All Maximal Cliques"],"prefix":"10.1007","author":[{"given":"Kazuhisa","family":"Makino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Barabasi, A.-L.: LINKED \u2013 The New Science of Networks. Perseus Publishing ,Cambridge(2002)"},{"key":"23_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"23_CR3","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":"23_CR4","doi-asserted-by":"publisher","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 App. Math.\u00a065, 21\u201346 (1996)","journal-title":"Discrete App. Math."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1024605820527","volume":"39","author":"E. Boros","year":"2003","unstructured":"Boros, E., Gurvich, V., Khachiyan, L., Makino, K.: On the complexity of generating maximal frequent and minimal infrequent sets. Annals of Math. and Artif. Int.\u00a039, 211\u2013221 (2003)","journal-title":"Annals of Math. and Artif. Int."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1137\/S0097539701388768","volume":"31","author":"E. Boros","year":"2002","unstructured":"Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L., Makino, K.: Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities. SIAM J. Comput.\u00a031, 1624\u20131643 (2002)","journal-title":"SIAM J. Comput."},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput.\u00a014, 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progression. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1137\/S009753970240639X","volume":"32","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Gottlob, G., Makino, K.: New results on monotone dualization and generating hypergraph transversals. SIAM J. Comput.\u00a032, 514\u2013537 (2003)","journal-title":"SIAM J. Comput."},{"key":"23_CR10","first-page":"62","volume-title":"Proc. AAAI 2002","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Makino, K.: On computing all abductive explanations. In: Proc. AAAI 2002, pp. 62\u201367. AAAI Press, Menlo Park (2002)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms, Info. Proc. Lett.\u00a051, 207\u2013211 (1994)","journal-title":"Proc. Lett."},{"key":"23_CR12","volume-title":"Formal Concept Analysis","author":"B. Ganter","year":"1996","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1996)"},{"key":"23_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569913","volume-title":"Efficient algorithms for listing combinatorial structures","author":"L.A. Goldberg","year":"1993","unstructured":"Goldberg, L.A.: Efficient algorithms for listing combinatorial structures. Cambridge University Press, NewYork (1993)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1998","unstructured":"Johnson, D.S., Yanakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Info. Proc. Lett.\u00a027, 119\u2013123 (1998)","journal-title":"Info. Proc. Lett."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Trawling the web for emerging cyber-communities. In: Proc. the Eighth International World Wide Web Conference, Toronto, Canada (1999)","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"E.L. Lawler","year":"1980","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets, NP-hardness and polynomial-time algorithms. SIAM J. Comput.\u00a09, 558\u2013565 (1980)","journal-title":"SIAM J. Comput."},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"23_CR18","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Closed set based discovery of small covers for association rules. In: Proc. 15emes Journees Bases de Donnees Avancees, pp. 361\u2013381 (1999)"},{"key":"23_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\u00a05, 237\u2013252 (1975)","journal-title":"Networks"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0004-3702(94)00069-7","volume":"82","author":"B. Selman","year":"1996","unstructured":"Selman, B., Levesque, H.J.: Support set selection for abductive and default reasoning. Artif. Int.\u00a082, 259\u2013272 (1996)","journal-title":"Artif. Int."},{"key":"23_CR21","doi-asserted-by":"publisher","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.\u00a06, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."},{"key":"23_CR22","unstructured":"Uno, T.: Fast algorithms for computing web communities and frequent sets by using maximal clique generations (in preparation)"},{"key":"23_CR23","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumeration algorithms,Technical Report of National Institute of Informatics, Japan (2003)"},{"key":"23_CR24","unstructured":"Uno, T., Asai, T., Arimura, H., Uchida, Y.: LCM: An efficient algorithm for enumerating frequent closed item sets In:Workshop on Frequent Itemset Mining Implementations (FIMI 2003) (2003)"},{"key":"23_CR25","unstructured":"Zaki, M.J., Ogihara, M.: Theoretical foundations of association rules .In: 3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (June 1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:27:07Z","timestamp":1619998027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}