tomtseng / dynamic-connectivity-hdt
Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
☆18Updated 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
- GBBS: Graph Based Benchmark Suite☆202Updated last month
- ☆11Updated 7 years ago
- ☆15Updated last month
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆46Updated last year
- ☆46Updated 2 years ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆29Updated 2 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated last week
- Parallel Graph Input Output☆17Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- Library for finding maximum cliques on graphs☆15Updated 3 years ago
- LEMON Graph Library☆34Updated 5 years ago
- Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.☆222Updated 3 months ago
- Dynamic data structure for sparse graphs.☆28Updated 9 months ago
- Quickly compute all maximal cliques of a graph☆76Updated 6 years ago
- Maximum clique computation over large sparse graphs☆19Updated 2 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆16Updated 6 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆413Updated this week
- ☆25Updated 4 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- Library for chordal matrix computations☆23Updated 6 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 2 months ago
- ☆20Updated 3 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 3 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆149Updated last year
- Trillion-edge Scale Graph Edge Partitioning☆26Updated 5 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆332Updated last month
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 6 years ago