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:
- GBBS: Graph Based Benchmark Suite☆211Updated 5 months ago
- ☆17Updated 5 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆38Updated 3 weeks ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Parallel Graph Input Output☆19Updated last year
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆25Updated 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
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆435Updated last month
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- C++ library for large-scale network analysis and computation☆27Updated last year
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- ☆25Updated 4 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- Parallel Weighted Random Sampling☆20Updated 4 years ago
- ☆47Updated 2 years ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆10Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- Quickly compute all maximal cliques of a graph☆78Updated 6 years ago
- Vienna Graph Clustering☆16Updated 4 months ago
- Master's thesis project involving label-constrained reachability (LCR)☆1Updated 4 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Dynamic data structure for sparse graphs.☆30Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆10Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Maximum clique computation over large sparse graphs☆19Updated 3 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆18Updated 7 years ago