KarypisLab / K-Truss
OpenMP-based parallel software for computing the truss decomposition of a graph.
☆12Updated 6 years ago
Alternatives and similar repositories for K-Truss:
Users that are interested in K-Truss are comparing it to the libraries listed below
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 6 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 4 years ago
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS☆12Updated 5 years ago
- ☆11Updated 7 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 6 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated 5 months ago
- ☆15Updated last month
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- Algorithms to list k-cliques in real-world graphs☆25Updated 3 years ago
- Distributed Graph Mining on a Massive "Single" Graph☆13Updated 4 years ago
- ☆18Updated 3 years ago
- Dynamic data structure for sparse graphs.☆28Updated 9 months ago
- ☆8Updated 8 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆25Updated 3 years ago
- ☆9Updated 6 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆14Updated 4 years ago
- ☆25Updated 4 years ago
- graph-based substructure pattern mining algorithm (authors: Xifeng Yan, Jiawei Han) implementation☆10Updated 7 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆14Updated 2 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- A general-purpose, distributed graph random walk engine.☆111Updated last year
- NetworkX Addon to allow graph partitioning with METIS☆78Updated last year
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 4 years ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago