KarypisLab / K-TrussLinks
OpenMP-based parallel software for computing the truss decomposition of a graph.
☆14Updated 7 years ago
Alternatives and similar repositories for K-Truss
Users that are interested in K-Truss are comparing it to the libraries listed below
Sorting:
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 3 months ago
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- ☆25Updated 10 months ago
- GBBS: Graph Based Benchmark Suite☆214Updated 2 months ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 7 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 2 months ago
- G3: A Programmable GNN Training System on GPU☆43Updated 5 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆10Updated 8 years ago
- Graph Challenge☆32Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆89Updated 6 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 5 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆25Updated 4 years ago
- High-Performance Streaming Graph Analytics on GPUs☆33Updated 6 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆67Updated 3 years ago
- ☆22Updated 4 years ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago
- Fitting power-law distributions to empirical data, according to the method of Clauset, Shalizi and Newman☆50Updated 9 months ago
- ☆25Updated 4 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆89Updated 5 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- A Framework for Graph Sampling and Random Walk on GPUs.☆38Updated 8 months ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆143Updated 2 years ago