gSparse: C++ Library for Graph Sparsification
☆12Apr 25, 2020Updated 6 years ago
Alternatives and similar repositories for gSparse
Users that are interested in gSparse are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Repository for effective resistance sampling code to create network sparsifiers.☆11Dec 1, 2021Updated 4 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Jun 9, 2020Updated 6 years ago
- Botao Wu, Zhendong Wang and Huamin Wang. 2022. A GPU-Based Multilevel Additive Schwarz Preconditioner for Cloth and Deformable Body Simul…☆16Sep 6, 2022Updated 3 years ago
- Python libraries for model order reduction, clustering and data analysis.☆10May 24, 2024Updated 2 years ago
- implementation of finite difference frequency domain equations for Maxwell's equations and the exploration of domain decomposition, speci…☆13Oct 21, 2018Updated 7 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Truncated QR/SVD linear solver.☆18Feb 14, 2017Updated 9 years ago
- uORF-Tools are a workflow and a collection of tools for the analysis of 'Upstream Open Reading Frames' (short uORFs)☆13Jul 30, 2019Updated 7 years ago
- ☆11Jul 31, 2019Updated 7 years ago
- DiffWire: Inductive Graph Rewiring via the Lovász Bound. In Proceedings of the First Learning on Graphs Conference. 2022. Adrian Arnaiz-R…☆18Jan 31, 2023Updated 3 years ago
- A C++ port of the IRLBA algorithm, based on the C code in the R package.☆18Aug 19, 2026Updated last week
- The `onnx` Python library (not `onnxruntime`, to be clear) running in the browser using Pyodide.☆12Oct 12, 2023Updated 2 years ago
- morgen - Model Order Reduction for Gas and Energy Networks☆19May 31, 2023Updated 3 years ago
- Three implementations of Tarjan’s Union-Find☆20Apr 28, 2021Updated 5 years ago
- Linear-time sampling algorithm for geometric inhomogeneous random graphs with a special case implementation for hyperbolic random graphs.☆16Dec 4, 2023Updated 2 years ago
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- Kinase Activity Predictions from shotgun proteomics☆13Apr 18, 2017Updated 9 years ago
- ☆14Jun 3, 2022Updated 4 years ago
- An evolutionary multi-start algorithm for the Steiner Tree Problem in graphs with a fast local search.☆13Sep 7, 2022Updated 3 years ago
- Singular Value Decomposition-like matrix factorization for collaborative filtering [recommender systems]☆18Dec 8, 2015Updated 10 years ago
- A parallel C++ MPI code to calculates the proper orthogonal decomposition modes (aka principal components) from a series of observations …☆18Jul 4, 2015Updated 11 years ago
- ☆41Apr 9, 2024Updated 2 years ago
- QRKit is an extension of Eigen C++ library that allows for efficient QR decomposition of sparse matrices with common sparsity patterns.☆17Oct 26, 2020Updated 5 years ago
- ☆26Jun 5, 2026Updated 2 months ago
- ☆13Sep 8, 2015Updated 10 years ago
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- Omega Index for evaluation of overlapping community structure - (Python package available through pip)☆12Dec 29, 2021Updated 4 years ago
- Parallel Solver for Large-Scale Sparse Matrix Computations (MPI)☆20Jan 5, 2026Updated 7 months ago
- node2vec implementation in C++☆53May 29, 2020Updated 6 years ago
- bktree data structure with a Python interface for a CPP implementation☆13Jan 11, 2017Updated 9 years ago
- Java code to build and run evaluation of Approximation Algorithms for the Directed Steiner Tree problem☆15Jul 25, 2017Updated 9 years ago
- Naïve implementations of some Krylov subspace methods without preconditioning