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 6 months ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆33Updated last year
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Updated 4 years ago
- GBBS: Graph Based Benchmark Suite☆215Updated last month
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 7 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆144Updated 2 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 6 years ago
- GraphMat graph analytics framework☆105Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Graph Challenge☆33Updated 6 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Updated 7 years ago
- Hypergraph Algorithms Package☆99Updated 2 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- Vienna Graph Clustering☆17Updated 2 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- CPAM: Compressed Parallel Augmented Maps☆26Updated 5 months ago
- ☆26Updated last week
- Graph edge partitioning algorithms☆48Updated 6 years ago
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- G3: A Programmable GNN Training System on GPU☆43Updated 5 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- ☆11Updated 6 years ago
- ☆25Updated 5 years ago