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
  ☆112Updated last year
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 2 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 3 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆28Updated 9 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆202Updated last month
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 5 years ago
• darrenstrash / open-mcs
  An open implementation of the MC family of maximum clique algorithms
  ☆11Updated 8 years ago
• athomo / kcore
  ☆11Updated 7 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
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆17Updated last year
• RapidsAtHKUST / ppSCAN
  ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo
  ☆30Updated 4 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 2 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆35Updated last week
• Xtra-Computing / Medusa
  Medusa: Building GPU-based Parallel Sparse Graph Applications with Sequential C/C++ Code
  ☆61Updated 4 years ago
• ScottKolo / Mongoose
  Graph Coarsening and Partitioning Library
  ☆31Updated 4 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆23Updated 7 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆21Updated last year
• iHeartGraph / Enterprise
  Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.
  ☆30Updated 7 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• As-12 / gSparse
  gSparse: C++ Library for Graph Sparsification
  ☆12Updated 4 years ago
• cuStinger / cuStinger
  This repository contains the cuStinger data structure used for dynamic graph representation.
  ☆19Updated 6 years ago
• Jokeren / gBolt
  gBolt--very fast implementation for gSpan algorithm in data mining
  ☆53Updated 3 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆149Updated last year
• kfoynt / LocalGraphClustering
  ☆137Updated 3 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆26Updated 5 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆111Updated last year