New algorithms for enumerating all maximal cliques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3111, Issue , 2004, Pages 260-272

  Makino, Kazuhisa ^a   Uno, Takeaki ^b  

^a OSAKA UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; TIME DELAY;

ALL MAXIMAL CLIQUES; BIPARTITE GRAPHS; COMPUTATIONAL EXPERIMENT; GRAPH G; MAXIMUM DEGREE; REAL-WORLD PROBLEM; SPARSE GRAPHS;

GRAPH THEORY;

EID: 33645216903     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_23     Document Type: Article

References (25)

1. A.-L. Barabasi, "LINKED - The New Science of Networks," Perseus Publishing, 2002.
2. R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, Proc. VLDB '94. pp. 487-499, 1994.
3. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A. I. Verkamo, Fast discovery of association rules, In Advances in Knowledge Discovery and Data Mining, MIT Press, pp. 307-328, 1996.
4. D. Avis and K. Fukuda, Reverse search for enumeration, Discrete App. Math., 65 (1996) 21-46.
5. E. Boros, V. Gurvich, L. Khachiyan and K. Makino, On the complexity of generating maximal frequent and minimal infrequent sets, Annals of Math. and Artif. Int., 39 (2003) 211-221.
6. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino, Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities, SIAM J. Comput., 31 (2002) 1624-1643.
7. N. Chiba and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput., 14 (1985) 210-223.
8. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progression, Journal of Symbolic Computation, 9 (1990) 251-280.
9. T. Eiter, G. Gottlob and K. Makino, New results on monotone dualization and generating hypergraph transversals, SIAM J. Comput., 32 (2003) 514-537.
10. T. Eiter and K. Makino, On computing all abductive explanations, Proc. AAAI '02, AAAI Press, pp. 62-67, 2002.
11. D. Eppstein, Arboricity and bipartite subgraph listing algorithms, Info. Proc. Lett., 51 (1994) 207-211.
12. B. Ganter and R. Wille, Formal Concept Analysis, Springer, 1996.
13. L. A. Goldberg, Efficient algorithms for listing combinatorial structures, Cambridge University Press, New York, 1993.
14. D. S. Johnson, M. Yanakakis and C. H. Papadimitriou, On generating all maximal independent sets, Info. Proc. Lett., 27 (1998) 119-123.
15. S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, Trawling the web for emerging cyber-communities, Proc. the Eighth International World Wide Web Conference, Toronto, Canada, 1999.
16. E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, Generating all maximal independent sets, NP-hardness and polynomial-time algorithms, SIAM J. Comput., 9 (1980) 558-565.
17. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering frequent closed itemsets for association rules, Proc. the 7th ICDT Conference, LNCS 1540, Springer, pp. 398-416, 1999.
18. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Closed set based discovery of small covers for association rules, Proc. 15emes Journees Bases de Donnees Avancees, pp. 361-381, 1999.
19. R. C. Read and R. E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, 5 (1975) 237-252.
20. B. Selman and H. J. Levesque, Support set selection for abductive and default reasoning, Artif. Int., 82 (1996) 259-272.
21. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Comput., 6 (1977) 505-517.
22. T. Uno, Fast algorithms for computing web communities and frequent sets by using maximal clique generations, In preparation.
23. T. Uno, Two general methods to reduce delay and change of enumeration algorithms, Technical Report of National Institute of Informatics, Japan, 2003.
24. T. Uno, T. Asai, H. Arimura and Y. Uchida, LCM: An efficient algorithm for enumerating frequent closed item sets. Workshop on Frequent Itemset Mining Implementations (FIMI'03).
25. M. J. Zaki and M. Ogihara, Theoretical foundations of association rules," 3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, June 1998.