A parameterized high performance library for computing maximum cliques in large sparse graphs.
Library of parallel algorithms for solving the maximum clique problem, k-clique, and for finding the largest temporal strong component problem.
Fast for big data. Benchmarked on graphs with hundreds of millions of vertices and up to 1.8 billion edges.
The Parallel Maximum Clique (PMC) Library is benchmarked on over 200+ graphs (of various types) where it is shown to outperform the competition.