Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
DOI10.1080/15427951.2014.986778zbMath1461.05219arXiv1411.7460OpenAlexW1594951361MaRDI QIDQ4985798
Wei-Keng Liao, Md. Mostofa Ali Patwary, Bharath Pattabiraman, Assefaw Hadish Gebremedhin, Alok N. Choudhary
Publication date: 26 April 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.7460
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Internet topics (68M11) Density (toughness, etc.) (05C42)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact bit-parallel algorithm for the maximum clique problem
- An order-clique-based approach for mining maximal co-locations
- An exact algorithm for the maximum clique problem
- Statistical analysis of financial networks
- The maximum clique problem
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- A fast algorithm for the maximum clique problem
- Exact algorithms for maximum clique: a computational study
- Multi-threading a state-of-the-art maximum clique algorithm
- Mixed constraint preconditioning in computational contact mechanics
- The university of Florida sparse matrix collection
- A new table of constant weight codes
- A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
- Handbook of Graph Theory
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- An Analysis of Some Graph Theoretical Cluster Techniques
- On Some Clustering Techniques
- A branch and bound algorithm for the maximum clique problem
This page was built for publication: Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
