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:
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 5 months ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- ☆25Updated 2 weeks ago
- GBBS: Graph Based Benchmark Suite☆214Updated 4 months ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- High-Performance Streaming Graph Analytics on GPUs☆34Updated 6 years ago
- ☆25Updated 4 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 3 months ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆34Updated last year
- Hornet data structure for sparse dynamic graphs and matrices☆90Updated 6 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 6 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Updated 7 years ago
- GraphMat graph analytics framework☆103Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆13Updated 3 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Graph Challenge☆32Updated 6 years ago
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆28Updated last month
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆144Updated 2 years ago
- A Distributed Multi-GPU System for Fast Graph Processing☆65Updated 7 years ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years ago