Listing All Maximal Cliques in Large Sparse Real-World Graphs
Abstract
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, Löffler, 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, 2006) in practice. However, the algorithm of Tomita et al. uses an adjacency matrix, which requires too much space for large sparse graphs. Our new algorithm opens the door for fast analysis of large sparse graphs whose adjacency matrix will not fit into working memory.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2011
- DOI:
- 10.48550/arXiv.1103.0318
- arXiv:
- arXiv:1103.0318
- Bibcode:
- 2011arXiv1103.0318E
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- F.2.2;
- G.2.2
- E-Print:
- 12 pages, 4 figures. To appear at the 10th International Symposium on Experimental Algorithms (SEA 2011)