New Algorithms for Enumerating All Maximal Cliques

  title={New Algorithms for Enumerating All Maximal Cliques},
  author={Kazuhisa Makino and Takeaki Uno},
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms for enumerating all maximal cliques. One runs with O(M(n)) time delay and in O(n) space and the other runs with O(∆) time delay and in O(n + m) space, where ∆ denotes the maximum degree of G, M(n) denotes the time needed to multiply two n×n matrices, and the latter one requires O(nm) time as a preprocessing. For a… CONTINUE READING
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 314 citations. REVIEW CITATIONS
181 Citations
22 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 181 extracted citations

314 Citations

Citations per Year
Semantic Scholar estimates that this publication has 314 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…