tomtseng / dynamic-connectivity-hdtLinks
Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
☆22Updated 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☆214Updated 2 months ago
- Parallel Graph Input Output☆18Updated 2 years ago
- A Toolkit for Programming Parallel Algorithms on Shared-Memory Multicore Machines☆389Updated last month
- ☆12Updated 8 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆462Updated 6 months ago
- Near-linear time algorithm for computing near-maximum independent set☆19Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- ☆25Updated 10 months ago
- Trillion-edge Scale Graph Edge Partitioning☆30Updated 6 years 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
- ☆49Updated 3 years ago
- C++ library for large-scale network analysis and computation☆27Updated last year
- ☆25Updated 4 years 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
- Unofficial unmaintained clone of LEMON Graph Library☆47Updated 5 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 2 months ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs☆134Updated 2 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated 3 weeks ago
- ☆22Updated 4 years ago
- Graph edge partitioning algorithms☆47Updated 6 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated 2 weeks ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆25Updated 10 years ago
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.☆237Updated 5 months ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 4 years ago
- General implementation of the PQ Tree algorithm.☆29Updated 14 years ago
- This is a library plus a test harness for collecting algorithms that use the GraphBLAS. For test coverage reports, see https://graphblas…☆258Updated last week