OpenMP-based parallel software for computing the truss decomposition of a graph.
☆14Mar 28, 2018Updated 8 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☆12Oct 12, 2020Updated 5 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Jun 7, 2026Updated 4 months ago
- Wesnoth AI Modification Demonstration Scenarios☆13Mar 29, 2020Updated 6 years ago
- A library of various helper routines and frameworks used by many of the lab's software☆80Jun 7, 2026Updated 4 months ago
- FirmTruss Community Search in Multilayer Networks☆11Nov 17, 2022Updated 3 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ☆16Sep 4, 2023Updated 3 years ago
- ☆12Aug 18, 2017Updated 9 years ago
- Multiplex network data used in the paper "Unraveling the Origin of Social Bursts in Collective Attention"☆16Jan 3, 2022Updated 4 years ago
- ☆26Jan 21, 2026Updated 8 months ago
- VNEC: A Vectorized Non-Empty Column Format for SpMV on cross-platform multicore CPUs☆10Feb 6, 2024Updated 2 years ago
- Optimizations on Graph500☆10Jul 15, 2016Updated 10 years ago
- Everyone loves OS☆24Jun 24, 2026Updated 3 months ago
- General, Hybrid and Optimized Sparse Toolkit (Bitbucket mirror)☆12Apr 8, 2021Updated 5 years ago
- Docker Images, installation scripts, and testing & benchmarking suite for Graph Databases☆37Feb 10, 2022Updated 4 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A Shared Memory Multithreaded Graph Benchmark Suite for Multicores☆37May 30, 2025Updated last year
- ☆42May 22, 2021Updated 5 years ago
- ☆12Sep 29, 2026Updated last week
- 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☆89Jun 24, 2019Updated 7 years ago
- A Method for efficiently processing SpMV using SIMD and load balancing☆17Apr 4, 2022Updated 4 years ago
- ParMETIS - Parallel Graph Partitioning and Fill-reducing Matrix Ordering☆179Jun 7, 2026Updated 4 months ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Dec 20, 2018Updated 7 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆21Mar 3, 2020Updated 6 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- Parallel Graph Input Output☆19Sep 23, 2026Updated 2 weeks ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆32Jan 23, 2019Updated 7 years ago
- A templated AVL tree with STL-style iterators and random access; written in C++.☆16Sep 9, 2016Updated 10 years ago
- Full disclosure for http://stackoverflow.com/questions/17465061/how-to-parse-space-separated-floats-in-c-quickly/17479702☆11Nov 6, 2016Updated 9 years ago
- MemLiner is a remote-memory-friendly runtime system.☆31Nov 1, 2022Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆47Sep 4, 2024Updated 2 years ago
- 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
- Cours d'introduction au langage Python, inspiré du tutoriel Python traduit en français.☆10Jan 14, 2022Updated 4 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Apr 24, 2022Updated 4 years ago
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆22Sep 26, 2021Updated 5 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
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36May 29, 2021Updated 5 years ago
- ☆26Jan 2, 2021Updated 5 years ago
- TimeFlow is a continuous-time time series model that uses implicit neural representations and a latent code adaptation mechanism to impu…☆16Nov 8, 2025Updated 11 months ago
- Python implementation of the Louvain method for community detection☆11Jul 4, 2017Updated 9 years ago