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 4 years ago
Alternatives and similar repositories for dynamic-connectivity:
Users that are interested in dynamic-connectivity are comparing it to the libraries listed below
- Supplementary Material to accompany the paper, DJ Warne, SA Sisson, C Drovandi (2019) Acceleration of expensive computations in Bayesian…☆13Updated 4 years ago
- Quickly compute all maximal cliques of a graph☆76Updated 6 years ago
- Content Addressable Memory using dimensionality reduction☆12Updated 7 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 2 years ago
- Optimal approximate sampling from discrete probability distributions☆17Updated 3 years ago
- C++ demo of deep neural networks (MLP, CNN)☆32Updated last year
- A framework for index based similarity search.☆19Updated 5 years ago
- Deep Learning framework in C++/CUDA that supports symbolic/automatic differentiation, dynamic computation graphs, tensor/matrix operation…☆52Updated 3 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆18Updated 5 years ago
- CUDA implementation of the Floyd-Warshall All pairs shortest path graph algorithm(with path reconstruction)☆38Updated 10 years ago
- ☆19Updated 7 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆31Updated 6 years ago
- RSVDPACK: Implementations of fast algorithms for computing the low rank SVD, interpolative and CUR decompositions of a matrix, using ran…☆88Updated 2 years ago
- A full-fledged yet minimalistic CUDA-based convolutional neural network library from scratch in C++☆15Updated 5 years ago
- A study of performance of optimal transport.☆10Updated 4 years ago
- ☆11Updated 7 years ago
- Fast C++ implementation of an O(NM) algorithm for the assignment problem.☆53Updated 3 years ago
- Train a Bipedal Robot to walk using Reinforcement Learning☆9Updated 6 years ago
- C++ library for reinforcement learning☆51Updated last year
- Solving LPs with convergent message passing☆64Updated last year
- Python code for "Fast Bayesian nonnegative matrix factorisation and tri-factorisation", presented at NIPS 2016 Workshop on Advances in Ap…☆20Updated 6 years ago
- chainer implementation of soft edit distance☆10Updated 4 years ago
- Dirichlet Process K-means☆47Updated 7 months ago
- data files for comparing optimal transport algorithms☆9Updated 5 years ago
- Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.☆57Updated 7 years ago
- Kalman Optimization for Value Approximation☆10Updated 4 years ago
- Langevin Incremental Mixture Importance Sampling☆8Updated 7 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 6 years ago
- Code accompanying my blog post on k-means in Python, C++ and CUDA☆58Updated 7 years ago