tomtseng / dynamic-connectivity-hdtLinks
Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
☆20Updated last year
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:
- Parallel Graph Input Output☆19Updated last year
- 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
- ☆18Updated 6 months ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆211Updated 6 months ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆39Updated last month
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- ☆12Updated 7 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆129Updated 2 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆30Updated 2 years ago
- VF2 - Subgraph Isomorphism☆47Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- ☆47Updated 2 years ago
- vertex cover solver☆30Updated 5 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆157Updated last year
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…☆33Updated 2 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- Quickly compute all maximal cliques of a graph☆79Updated 6 years ago
- Library for finding maximum cliques on graphs☆15Updated 3 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 2 months ago
- Code and data for the Clustering Uncertain Graphs paper☆10Updated 2 years ago
- Vienna Graph Clustering☆16Updated 5 months ago