tomtseng / dynamic-connectivity-hdtLinks
Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
☆21Updated 2 years ago
Alternatives and similar repositories for dynamic-connectivity-hdt
Users that are interested in dynamic-connectivity-hdt are comparing it to the libraries listed below
Sorting:
- GBBS: Graph Based Benchmark Suite☆213Updated 2 months ago
- Parallel Graph Input Output☆20Updated 2 years ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- ☆25Updated 10 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆458Updated 5 months ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆382Updated 3 weeks ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated 2 months ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆50Updated 2 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- ☆25Updated 4 years ago
- Graph edge partitioning algorithms☆47Updated 5 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- ☆49Updated 3 years ago
- ☆12Updated 8 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated 3 months ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Updated 3 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 3 months ago
- Vienna Graph Clustering☆16Updated 2 months ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆25Updated 10 years ago
- C++ library for large-scale network analysis and computation☆27Updated last year
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 5 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆161Updated last year
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- vertex cover solver☆30Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- An efficient C++ multi-threaded sorting function based on C++11 threads☆27Updated 9 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- CPAM: Compressed Parallel Augmented Maps☆25Updated last month