LijunChang / MC-BRB

Related projects: ⓘ

• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆75Updated 5 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆24Updated 3 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆17Updated 2 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆0Updated 3 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆16Updated 5 years ago
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆13Updated 5 months ago
• RapidsAtHKUST / AccTrussDecomposition
  Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …
  ☆14Updated 4 years ago
• athomo / kcore
  ☆9Updated 7 years ago
• RapidsAtHKUST / ContinuousSubgraphMatching
  Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…
  ☆40Updated last year
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆25Updated 2 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆25Updated 3 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆12Updated 3 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆24Updated 6 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆19Updated last week
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆26Updated 5 months ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆141Updated 10 months ago
• beginner1010 / butterfly-counting
  The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS
  ☆12Updated 5 years ago
• HKUST-KnowComp / NeuralSubgraphCounting
  Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"
  ☆50Updated last month
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆26Updated 4 years ago
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆12Updated 6 years ago
• wheatman / Packed-Memory-Array
  ☆12Updated 4 months ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆21Updated last year
• rahulyesantharao / batch-dynamic-kdtree
  Parallel, batch-dynamic kdtree
  ☆10Updated 2 years ago
• RapidsAtHKUST / SimRank
  1) SimRank (single pair query, parallel all pair computation / dynamic updates) - by Yue Wang (https://github.com/KeithYue) and Yulin Che…
  ☆14Updated 4 years ago
• JongikKim / Nass
  ☆14Updated last month
• RapidsAtHKUST / ppSCAN
  ppSCAN: Parallelizing Pruning-based Graph Structural Clustering (ICPP'18) - by Yulin Che, Shixuan Sun and Prof. Qiong Luo
  ☆30Updated 4 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 3 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 3 years ago
• Cecca / ugraph
  Code and data for the Clustering Uncertain Graphs paper
  ☆9Updated last year