rafaelglikis / dynamic-connectivity
There is given an undirected graph G = (V, E) from which edges are deleted one at a time. Questions like "Are the vertices u and v in the same connected component?" have to be answered in constant time.
☆9Updated 5 years ago
Alternatives and similar repositories for dynamic-connectivity:
Users that are interested in dynamic-connectivity are comparing it to the libraries listed below
- Quickly compute all maximal cliques of a graph☆78Updated 6 years ago
- A C++ neural network library for machine learning☆14Updated 11 months ago
- linear (time,space) greedy set cover implementation☆30Updated 3 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- data files for comparing optimal transport algorithms☆9Updated 5 years ago
- Fast C++ implementation of an O(NM) algorithm for the assignment problem.☆53Updated 3 years ago
- Optimal approximate sampling from discrete probability distributions☆17Updated 4 years ago
- Python code for intrinsic dimension estimation of generic datasets☆19Updated 6 years ago
- Open Solver Interface☆57Updated 3 months ago
- Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.☆57Updated 7 years ago
- Fast Fast Hadamard Transform☆78Updated 3 years ago
- Vienna Graph Clustering☆16Updated 2 months ago
- C++ fast hierarchical clustering algorithms☆87Updated last year
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 3 years ago
- CUDA-accelerated minimum spanning tree algorithm -- data parallel Boruvka's algorithm☆19Updated 8 years ago
- A C++ RangeTree implementation.☆43Updated 4 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆31Updated 6 years ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆52Updated last year
- Code to speed up k-means clustering. Originally at BaylorCS/baylorml.☆55Updated 10 months ago
- A parallelized implementation of Principal Component Analysis (PCA) using Singular Value Decomposition (SVD) in OpenMP for C. The procedu…☆17Updated 5 years ago
- implementation of PARADIS - fast parallel radix sort algorithm. http://www.vldb.org/pvldb/vol8/p1518-cho.pdf☆9Updated 2 years ago
- Sparse Matrix - Simple implementation of Sparse Matrix Operations in C++.☆17Updated 6 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- NetworkX Addon to allow graph partitioning with METIS☆78Updated 2 years ago
- Skeletonide is a parallel implementation of Zhang-Suen morphological thinning algorithm written in Halide-lang. Use it for fast skeletoni…☆13Updated 4 years ago
- A C++ Library of Genetic Algorithm Components☆12Updated 12 years ago
- RSVDPACK: Implementations of fast algorithms for computing the low rank SVD, interpolative and CUR decompositions of a matrix, using ran…☆89Updated 2 years ago
- tokenizer and parser for circle projects☆11Updated 5 years ago
- General implementation of the PQ Tree algorithm.☆28Updated 14 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 7 years ago