OpenMP-based parallel software for computing the truss decomposition of a graph.
☆14Mar 28, 2018Updated 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Parallel k-core Decomposition on Multicore Platforms☆11Oct 12, 2020Updated 5 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Feb 11, 2026Updated last month
- A library of various helper routines and frameworks used by many of the lab's software☆76Feb 23, 2026Updated last month
- ☆16Sep 4, 2023Updated 2 years ago
- ☆12Aug 18, 2017Updated 8 years ago
- ☆26Jan 21, 2026Updated 2 months ago
- ☆10Sep 8, 2020Updated 5 years ago
- Optimizations on Graph500☆10Jul 15, 2016Updated 9 years ago
- Code and data for the Clustering Uncertain Graphs paper☆10Nov 22, 2022Updated 3 years ago
- General, Hybrid and Optimized Sparse Toolkit (Bitbucket mirror)☆12Apr 8, 2021Updated 4 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16May 25, 2020Updated 5 years ago
- Benchmark of common hash functions☆38Sep 15, 2019Updated 6 years ago
- Docker Images, installation scripts, and testing & benchmarking suite for Graph Databases☆37Feb 10, 2022Updated 4 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆12Apr 6, 2020Updated 5 years ago
- ☆18Jul 31, 2023Updated 2 years ago
- Sparse data processing library with a generic, HPC-centric design, supports feature extraction, IO, reordering and partitioning.☆25Aug 6, 2025Updated 7 months ago
- A Shared Memory Multithreaded Graph Benchmark Suite for Multicores☆36May 30, 2025Updated 9 months ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆18Nov 24, 2018Updated 7 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Jun 24, 2019Updated 6 years ago
- A Method for efficiently processing SpMV using SIMD and load balancing☆17Apr 4, 2022Updated 3 years ago
- a tester for BLAS libraries including OpenBLAS and Intel MKL. This project is based on ATLAS BLAS Tester☆37Feb 2, 2023Updated 3 years ago
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆172Dec 8, 2023Updated 2 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆22Mar 3, 2020Updated 6 years ago
- Parallel Graph Input Output☆18Jul 18, 2023Updated 2 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Apr 23, 2020Updated 5 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆31Jan 23, 2019Updated 7 years ago
- A New Format for SIMD-accelerated SpMV☆22Apr 4, 2022Updated 3 years ago
- A templated AVL tree with STL-style iterators and random access; written in C++.☆16Sep 9, 2016Updated 9 years ago
- k3的固件和插件备份仓库，Mac下解决音乐解锁插件证书到期，升级ssr-plus和v2ray版本,以及xray☆15Sep 30, 2021Updated 4 years ago
- Data analysis pipelines☆11Mar 19, 2021Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Dec 16, 2019Updated 6 years ago
- Dynamic matrix type and algorithms for sparse matrices☆23Feb 12, 2025Updated last year
- Collection of C++ Coroutine sample code☆12Feb 14, 2024Updated 2 years ago
- Parallelized and vectorized SpMV on Intel Xeon Phi (Knights Landing, AVX512, KNL)☆24Feb 12, 2024Updated 2 years ago
- Making high-accuracy and visually-interpretable decision tree-based models for semantic segmentation http://segnbdt.aaalv.in☆11Oct 12, 2021Updated 4 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Apr 24, 2022Updated 3 years ago
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆49Jul 7, 2019Updated 6 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Dec 4, 2019Updated 6 years ago