tomtseng / dynamic-connectivity-hdt
Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
☆19Updated 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
- ☆17Updated 3 months ago
- Parallel Graph Input Output☆18Updated last year
- GBBS: Graph Based Benchmark Suite☆204Updated 3 months ago
- Maximum clique computation over large sparse graphs☆19Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated 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…☆49Updated 2 years ago
- Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.☆224Updated 5 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Library for finding maximum cliques on graphs☆15Updated 3 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Dynamic data structure for sparse graphs.☆30Updated last year
- ☆47Updated 2 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- ☆11Updated 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
- ☆18Updated 3 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆425Updated 2 weeks ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- ☆11Updated 10 months ago
- ☆25Updated 4 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆78Updated 6 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 4 years ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- A library of various helper routines and frameworks used by many of the lab's software☆50Updated 11 months ago