KarypisLab / K-Truss
OpenMP-based parallel software for computing the truss decomposition of a graph.
☆12Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for K-Truss
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 4 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆16Updated 6 years ago
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆24Updated 3 years ago
- ☆10Updated 7 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- NetworkX Addon to allow graph partitioning with METIS☆78Updated last year
- ☆9Updated 6 years ago
- ☆8Updated 7 years ago
- A general-purpose, distributed graph random walk engine.☆110Updated last year
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆25Updated 3 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 5 years ago
- ☆25Updated 3 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆13Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- A streaming algorithm for graph clustering☆13Updated 6 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆13Updated 2 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆10Updated 7 years ago
- Near-linear time algorithm for computing near-maximum independent set☆17Updated 2 years ago
- Dynamic data structure for sparse graphs.☆27Updated 7 months ago
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 4 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆28Updated 5 years ago
- WebGraph framework with extensions☆22Updated 9 years ago
- A scalable distributed graph partitioner. Ongoing research.☆15Updated 7 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 5 years ago
- Parallel Frequent Subgraph Mining☆28Updated 7 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆65Updated 2 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 5 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆26Updated 6 years ago