Enumeration of isolated cliques and pseudo-cliques

ACM Transactions on Algorithms

Volumn 5, Issue 4, 2009, Pages

  Ito, Hiro ^a   Iwama, Kazuo ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Clique; Enumeration; Isolation

Indexed keywords

AVERAGE DEGREE; GRAPH G; INCREASING FUNCTIONS; INDUCED SUBGRAPHS; ISOLATED CLIQUES; LINEAR TIME; MAXIMAL CLIQUE; MINIMUM DEGREE; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; POSITIVE REAL; SUBGRAPHS; SUPERLINEAR; SUPERPOLYNOMIAL NUMBERS;

NUMBER THEORY;

POLYNOMIAL APPROXIMATION;

EID: 76649097686     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1597036.1597044     Document Type: Article

References (20)

1. ARORA, S.,KARGER,D. R., ANDKARPINSKI,M. 1995. Polynomial time approximation schemes for dense instances of np-hard problems. In Proceedings of the 27th ACM Symposium on Theory of Computing. ACM, New York, 284-293.
2. ASAHIRO, Y., HASSIN, R., AND IWAMA, K. 2002. Complexity of finding dense subgraph. Discrete Appl. Math. 121, 1-3, 15-26.
3. ASAHIRO, Y., IWAMA, K., TAMAKI, H., AND TOKUYAMA, T. 2000. Greedily finding a dense subgraph. J. Algor. 34, 203-221.
4. BOMZE, I. 1999. The maximum clique problems. In Handbook of Combinatorial Optimization (Supplement Volume A). Kluwer, Dordrecht, 1-74.
5. DOWNEY, R. G. AND FELLOWS, M. R. 1995. Fixed-Parameter tractability and completeness ii: On completeness for w[1]. Theor. Comput. Sci. 141, 1 & 2, 109-131.
6. DOWNEY, R. G. AND FELLOWS, M. R. 1999. Parameterized Complexity. Springer, New York.
7. FEIGE, U., KORTSARZ, G., AND PELEG, D. 2001. The dense k-subgraph problem. Algorithmica 29, 3, 410-421
8. FLAKE, G. W., LAWRENCE, S., AND GILES, C. L. 2000. Efficient identification of Web communities. In Proceedings of the 6th International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD'00). ACM, New York, 150-160.
9. GIBSON, D.,KLEINBERG, J.M., ANDRAGHAVAN, P. 1998. InferringWeb communities from link topology. In Proceedings of the UK Conference on Hypertext. 225-234.
10. HE, X., ZHA, H., DING, C., AND SIMON, H. 2001. Web document clustering using hyperlink structures. Tech. rep. CSE-01-006, Acta Mathematica.
11. 1?ε. Acta Mathematica 182, 105-142.
12. ITO, H., IWAMA, K., AND OSUMI, T. 2005. Linear-Time enumeration of isolated cliques. In Proceedings of the 13th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol.3669. Springer, Berlin, 119-130.
13. JOHNSON, D. AND TRICK, M. 1999. Cliques, coloring, and satisfiability: Second dimacs implementation challenge. DIMACS Series in Discrete Math. Theor. Comput. Sci. vol.26.
14. KOMUSIEWICZ, C., HÜFFNER, F., MOSER, H., AND NIEDERMEIER, R. 2007. Isolation concepts for enumerating dense subgraphs. In Proceedings of the 13th International Computing and Combinatorics Conference. Lecture Notes in Computer Science, vol.4598. Springer, Berlin, 140-150.
15. KORTSARZ, G. AND PELEG, D. 1993. On choosing a dense subgraph. In Proceedings of the 34th Annual IEEE Symposium on Foundation of Computer Science. IEEE, 692-701.
16. MAKINO, K. AND UNO, T. 2004. New algorithms for enumerating all maximal cliques. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol.3111. Springer, Berlin, 260-272.
17. MOON, J. AND MOSER, L. 1965. On cliques in graphs. Israel J. Math. 3, 23-28.
18. REDDY, P.K. ANDKITSUREGAWA,M. 2001. An approach to relate theWeb communities through bipartite graphs. In Proceedings of the 2nd International Conference on Web Information Systems Engineering. 301-310.
19. SIMON, H. U. 1990. On approximate solutions for combinatorial optimization problems. SIAM J. Disc. Math. 3, 294-310.
20. TOMITA, E., TANAKA, A., AND TAKAHASHI, H. 2006. The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363, 1, 28-42.