Liron Sade
ABSTRACT
Maximal clique enumeration is a well-studied problem due to its many applications. We present a new algorithm for this problem that enumerates maximal cliques in a diverse ordering. The main idea behind our approach is to adapt the classic Bron-Kerbosch (BK) algorithm by, conceptually, jumping between different nodes in the execution tree. Special care is taken to ensure that (1) each maximal clique is created precisely once, (2) the theoretical runtime remains the same as in the BK algorithm and (3) memory requirements remain reasonable. Experimental results show that we indeed achieve our goals, and moreover, that the cliques are enumerated in a diverse order.
Supplemental Material
- V. Boginski, S. Butenko, and P. M. Pardalos. 2005. Statistical analysis of financial networks. Comput. Statistics and Data Analysis, Vol. 48, 2 (2005).Google Scholar
- Z. Chen, L. Yuan, X. Lin, L. Qin, and J. Yang. 2020. Efficient Maximal Balanced Clique Enumeration in Signed Networks. In WWW.Google Scholar
- J. Cheng, L. Zhu, Y. Ke, and S. Chu. 2012. Fast algorithms for maximal clique enumeration with limited memory. In SIGKDD.Google Scholar
- A. Conte, R. Grossi, A. Marino, and L. Versari. 2020. Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica, Vol. 82, 6 (2020), 1547--1573.Google ScholarDigital Library
- A. Das, S.-V. Sanei-Mehri, and S. Tirthapura. 2020. Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs. ACM Trans. Parallel Comput., Vol. 7, 1 (2020), 5:1--5:28.Google ScholarDigital Library
- Y. Fried, D.A. Kessler, and N.M. Shnerb. 2016. Communities as Cliques. Nature Scientific Reports, Vol. 6, 35648 (2016).Google Scholar
- N. Modani and K. Dey. 2008. Large maximal cliques enumeration in sparse graphs. In CIKM.Google Scholar
- S. Mohseni-Zadeh, P. Brézellec, and J.-L. Risler. 2004. Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques. Comput. Biology and Chemistry, Vol. 28, 3 (2004), 211 -- 218.Google ScholarDigital Library
- J. W. Moon and L. Moser. 1965. On cliques in graphs. Israel journal of Mathematics, Vol. 3, 1 (1965), 23--28.Google ScholarCross Ref
- E. Tomita, A. Tanaka, and H. Takahashi. 2006. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical computer science, Vol. 363, 1 (2006), 28--42.Google Scholar
- L. G Valiant. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput., Vol. 8, 3 (1979), 410--421.Google ScholarDigital Library
- J. Wang, J. Cheng, and A. W.-C. Fu. 2013. Redundancy-aware maximal cliques. In SIGKDD.Google Scholar
- L. Yuan, L. Qin, X. Lin, L. Chang, and W. Zhang. 2016. Diversified top-k clique search. The VLDB Journal, Vol. 25, 2 (2016), 171--196.Google ScholarDigital Library
Index Terms
- Diverse Enumeration of Maximal Cliques
Recommendations
Enumeration aspects of maximal cliques and bicliques
We present a general framework to study enumeration algorithms for maximal cliques and maximal bicliques of a graph. Given a graph G, we introduce the notion of the transition graph T(G) whose vertices are maximal cliques of G and arcs are transitions ...
Enumeration of isolated cliques and pseudo-cliques
In this article, we consider isolated cliques and isolated dense subgraphs. For a given graph G, a vertex subset S of size k (and also its induced subgraph G(S)) is said to be c-isolated if G(S) is connected to its outside via less than ck edges. The ...
A new decomposition technique for maximal clique enumeration for sparse graphs
AbstractGiven a graph, we are interested in the question of finding all its maximal cliques. This question models the community detection problem and has been extensively studied. Here, we approach it under the light of an important graph ...
Comments