Alternatives and similar repositories for quick-cliques:

Users that are interested in quick-cliques are comparing it to the libraries listed below

• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆115Updated last year
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆18Updated last year
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆208Updated 4 months ago
• athomo / kcore
  ☆11Updated 7 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆133Updated last year
• cuStinger / cuStinger
  This repository contains the cuStinger data structure used for dynamic graph representation.
  ☆19Updated 6 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆61Updated 4 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• ECP-ExaGraph / vite
  MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…
  ☆27Updated last year
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆30Updated 6 years ago
• vazois / TopK
  TopK Algorithms Benchmark
  ☆10Updated 5 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆82Updated 5 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆30Updated 9 months ago
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆31Updated 7 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆27Updated 5 years ago
• RapidsAtHKUST / ppSCAN
  ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo
  ☆30Updated 4 years ago
• ECP-ExaGraph / grappolo
  OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques
  ☆20Updated last year
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated 2 months ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆78Updated last year
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆25Updated 3 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated last month
• syhlalala / PAM-AE
  ☆9Updated 6 years ago