Listing All Maximal Cliques in Large Sparse Real-World Graphs

@article{Eppstein2013ListingAM,
  title={Listing All Maximal Cliques in Large Sparse Real-World Graphs},
  author={David Eppstein and Maarten L{\"o}ffler and Darren Strash},
  journal={ACM Journal of Experimental Algorithms},
  year={2013},
  volume={18}
}
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 analysis shows that this algorithm is the first to offer a practical solution to listing all maximal cliques in large sparse graphs. All other theoretically-fast algorithms for sparse graphs have been shown to be significantly slower than the algorithm of Tomita et al. (Theoretical Computer Science… Expand

Figures and Tables from this paper

Maximal strongly connected cliques in directed graphs: Algorithms and bounds
Abstract Finding communities in the form of cohesive subgraphs is a fundamental problem in network analysis. In domains that model networks as undirected graphs, communities are generally associatedExpand
A Constructive Arboricity Approximation Scheme
TLDR
The conversion implies a near-exact algorithm that computes a partition into at most $\Gamma+2$ forests in $O(m\log n \,\Gamma \log^* \Gamma)$ time, which might also pave the way to faster exact arboricity algorithms. Expand
An Experimental Study of a 1-planarity Testing and Embedding Algorithm
TLDR
This work investigates the feasibility of a $1-planarity testing and embedding algorithm based on a backtracking strategy and shows that it can be successfully applied to graphs with up to 30 vertices, but suggests the need of more sophisticated techniques to attack larger graphs. Expand
Analysis of Financial Network Topological Dynamics of the Russian Stock Market from 2012 to 2019
TLDR
This paper constructs market networks for 75 consecutive overlapping 250-day periods to analyze the dynamics of the structural properties of the market rank-correlation-based network and concludes that degree distribution and maximum clique size are the essential graph attributes and give insight into Russian financial market structure. Expand
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems
TLDR
This paper explains how state of the art maximum cliques, maximum weighted clique, maximal clique enumeration and maximum common (connected) induced subgraph algorithms can be turned into certifying solvers by using pseudo-Boolean models and cutting planes proofs. Expand
Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph
TLDR
This paper considers the problem of listing the maximal k-degenerate induced subgraphs of a chordal graph, and proposes an output-sensitive algorithm using delay O ( m ⋅ ω ( G ) ) for any n-vertex chordalgraph with m edges, and shows that solving this problem is np -complete. Expand
Efficient maximum clique computation and enumeration over large sparse graphs
TLDR
A new branch-reduce-&-bound framework for KCF over dense graphs is developed by proposing light-weight reducing techniques and leveraging the advanced branching and bounding techniques that are used in the existing MCC solvers for dense graphs. Expand
Integrated chromosomal and plasmid sequence analyses reveal diverse modes of carbapenemase gene spread among Klebsiella pneumoniae
TLDR
An integrated, high-resolution analysis of both chromosome and plasmid sequences using Klebsiella pneumoniae isolates sampled during a European survey revealed three contrasting modes of dissemination used by carbapenemase genes, which confer resistance to last-linecarbapenems. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 81 REFERENCES
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
TLDR
This paper employs approximation algorithms for the graph-partitioning problem to characterize as a function of size the statistical and structural properties of partitions of graphs that could plausibly be interpreted as communities, and defines the network community profile plot, which characterizes the "best" possible community—according to the conductance measure—over a wide range of size scales. Expand
On cliques in graphs
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliquesExpand
A note on the problem of reporting maximal cliques
TLDR
This note shows that the strategy of Tomita et al. is a simple modification of the Bron-Kerbosch algorithm, based on an (un-exploited) observation raised in Koch's paper. Expand
The worst-case time complexity for generating all maximal cliques and computational experiments
TLDR
A depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm, which proves that its worst-case time complexity is O(3n/3) for an n-vertex graph. Expand
A New Algorithm for Generating All the Maximal Independent Sets
TLDR
This paper presents a new efficient algorithm for generating all the maximal independent sets, for which processing time and memory space are bounded by $O(nm\mu)$ and $O (n+m)$, respectively, where n, m, and $\mu$ are the numbers of vertices, edges, and maximalIndependent sets of a graph. Expand
Algorithm 457: finding all cliques of an undirected graph
Description bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph. A recent paper [1] describes a number of techniques to findExpand
Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices
TLDR
A data structure is presented such that each entry in the adjacency matrix of a planar graph can be looked up in constant time, and can be constructed in linear time. Expand
The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations
TLDR
Novel decomposition strategies are tuned to the data and coupled with the best FPT MCE implementations, and it is demonstrated that the resultant run times are frequently reduced, and that instances once prohibitively time-consuming to solve are now often brought into the domain of realistic feasibility. Expand
Finding maximal cliques in massive networks by H*-graph
TLDR
This work proposes a novel notion, H*-graph, which defines the core of a network and extends to encompass the neighborhood of the core for MCE computation, and proposes the first external-memory algorithm for M CE (ExtMCE) that uses the H-graph to bound the memory usage. Expand
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
TLDR
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). Expand
...
1
2
3
4
5
...