Listing k-cliques in Sparse Real-World Graphs*

  title={Listing k-cliques in Sparse Real-World Graphs*},
  author={Maximilien Danisch and Oana Balalau and Mauro Sozio},
  journal={Proceedings of the 2018 World Wide Web Conference},
Motivated by recent studies in the data mining community which require to efficiently list all k-cliques, we revisit the iconic algorithm of Chiba and Nishizeki and develop the most efficient parallel algorithm for such a problem. Our theoretical analysis provides the best asymptotic upper bound on the running time of our algorithm for the case when the input graph is sparse. Our experimental evaluation on large real-world graphs shows that our parallel algorithm is faster than state-of-the-art… 

Figures and Tables from this paper

Ordering heuristics for k-clique listing
A comprehensive comparison of all the state-of-the-art k-clique listing and counting algorithms is presented and a new color ordering heuristics based on greedy graph coloring techniques which is able to significantly prune the unpromising search paths is proposed.
Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations
CITRON (Clique counting with Traffic Reducing Optimizations) is presented to improve the parallel scalability and thus overall performance of clique counting and significantly outperforms kClist while counting moderately sized cliques, and thus increases the size of graph practical for clique count.
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs
It is proved that many different kinds of maximal near-cliques can be enumerated in polynomial time (and FPT in c) for c-closed graphs, which underscores the significance of the c- closed graph class for theoretical understanding of social network analysis.
Parallel Clique Counting and Peeling Algorithms
A new parallel algorithm is presented that has polylogarithmic span and is work-efficient with respect to the well-known sequential algorithm for $k$-clique listing by Chiba and Nishizeki and new parallel algorithms for producing unbiased estimations of clique counts are designed.
The Power of Pivoting for Exact Clique Counting
The main insight is the construction of a Succinct Clique Tree (SCT) that stores a compressed unique representation of all cliques in an input graph using a technique called pivoting, a classic approach by Bron-Kerbosch to reduce the recursion tree of backtracking algorithms for maximal cliques.
Lightning Fast and Space Efficient k-clique Counting
This work develops two novel dynamic programming based k-color set sampling techniques to efficiently estimate the k-clique counts, where a k- Color set contains k nodes with k different colors, which are extremely efficient and accurate.
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs
A surprisingly simple procedure is given that can be employed to find the maximal k-clique densest subgraph in large-real world graphs and is complemented with an extensive experimental evaluation showing the effectiveness of the approach in large real-world graphs.
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
We present a parallel k-clique listing algorithm with improved work bounds (for the same depth) in sparse graphs with low degeneracy or arboricity. We achieve this by introducing and analyzing a new
Clique percolation method: memory efficient almost exact communities
This work builds on top of recent work that showed that it is possible to efficiently list all k-cliques in very large real-world graphs for medium values of k and proposes another algorithm, cpmz, that provides a solution close to the exact one, using more time but less memory.
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]
The comprehensive experiments reveal that the proposed algorithms outperform the state-of-the-art algorithms by 3 .


Listing All Maximal Cliques in Large Sparse Real-World Graphs
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, Loffler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs. Our
The K-clique Densest Subgraph Problem
An interesting consequence of this work is that triangle counting, a well-studied computational problem in the context of social network analysis can be used to detect large near-cliques.
Clique Counting in MapReduce
The first exact scalable algorithm for counting (and listing) k-cliques in MapReduce is designed, which matches the best-known bounds for triangle listing when k = 3 and is work optimal in the worst case for any k, while keeping the communication cost independent of k.
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling
This paper presents a sampling scheme that gives densest subgraph sparsifier, yielding a randomized algorithm that produces high-quality approximations while providing significant speedups and improved space complexity, and devise an exact algorithm that can treat both clique and biclique densities in a unified way.
Parallel $(k)$-Clique Community Detection on Large-Scale Networks
A novel, parallel k-clique community detection method, based on an innovative technique which enables connected components of a network to be obtained from those of its subnetworks, and hence is able to make full use of computational resources.
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
There exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy, and this algorithm matches the Θ(d(n − d)3 d/3) worst-case output size of the problem whenever n − d = Ω(n).
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem
A new randomized algorithm is presented that provably approximates the number of k-cliques, for any constant k, using the classic Turán's theorem, and it is found that TURÀN-SHADOW is generally much faster and more accurate than a range of other sampling algorithms.
Efficient semi-streaming algorithms for local triangle counting in massive graphs
This is the first paper that addresses the problem of local triangle counting with a focus on the efficiency issues arising in massive graphs and proposes two approximation algorithms, which are based on the idea of min-wise independent permutations.
A scalable, parallel algorithm for maximal clique enumeration
Discovering Large Dense Subgraphs in Massive Graphs
D dense subgraph extraction is proposed as a useful primitive for spam detection, and its incorporation into the workflow of web search engines is discussed.