Linear-time enumeration of isolated cliques

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 119-130

  Ito, Hiro ^a   Iwama, Kazuo ^a   Osumi, Tsuyoshi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS;

ISOLATED CLIQUES; LINEAR-TIME ENUMERATION; POLYNOMIAL TIME; SUPERPOLYNOMIAL NUMBERS;

LINEAR PROGRAMMING;

EID: 27144509327     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_13     Document Type: Conference Paper

References (17)

1. J. Abello, A. L. Buchsbaum, and J. R. Westbrook: A functional approach to external graph algorithms, Algorithmica, 32 (2002) 437-458.
2. S. Arora, D. R. Karger and M. Karpinski: Polynomial time approximation schemes for dense instances of NP-hard problems, In Proceedings of the 27th ACM Symposium on Theory of Computing (1995) 284-293.
3. Y. Asahiro, R. Hassin and K. Iwama: Complexity of finding dense subgraph, Discrete Applied Mathematics, 121, Issue 1-3 (2002) 15-26.
4. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama: Greedily finding a dense subgraph, J. Algorithms, 34 (2000) 203-221.
5. I. Bomze: The Maximum Clique Problem, Handbook of Combinatorial Optimization (Supplement Volume A), Kluwer, 1999.
6. R. Downey, M. Fellows: Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Theor. Comput. Sci. 141(1 & 2) (1995) 109-131.
7. R. G. Downey and M. R. Fellows: Parametrized Complexity, Springer, 1999.
8. G. W. Flake, S. Lawrence, and C. L. Giles: Efficient identification of web communities, In Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD-2000), 150-160, Boston, MA, ACM Press (2000).
9. D. Gibson, J. M. Kleinberg and P. Raghavan: Inferring web communities from link topology, UK Conference on Hypertext (1998) 225-234.
10. 1-ε, Acta Mathematica 182 (1999) 105-142.
11. X. He, H. Zha, C. Ding, and H. Simon: Web document clustering using hyperlink structures, Tech. Rep. CSE-01-006, Department of Computer Science and Engineering, Pennsylvania State University (2001).
12. D. Johnson and M. Trick (Eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, American Mathematical Society (1996).
13. G. Kortsarz and D. Peleg: On choosing a dense subgraph, In Proceedings of the 34th Annual IEEE Symposium on Foundation of Computer Science (1993) 692-701.
14. J. Moon and L. Moser: On cliques in graphs, Israel Journal of Mathematics, 3 (1965) 23-28.
15. P. K. Reddy and M. Kitsuregawa: An approach to relate the web communities through bipartite graphs, In Proceedings of The Second International Conference on Web Information Systems Engineering (2001) 301-310.
16. H. U. Simon: On approximate solutions for combinatorial optimization problems, SIAM J. Disc. Math. 3 (1990) 294-310.
17. K. Makino and T. Uno: New algorithms for enumerating all maximal cliques, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, LNCS, 3111 (2004) 260-272.