ciaranm / parasols
Parallel solvers for hard problems
☆12Updated 2 years ago
Alternatives and similar repositories for parasols:
Users that are interested in parasols are comparing it to the libraries listed below
- A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.☆74Updated 3 weeks ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 3 weeks ago
- CP 2015 subgraph isomorphism experiments, data and paper☆13Updated 9 years ago
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated 2 weeks ago
- Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.☆64Updated this week
- Management of Benchmark Instances and Instance Attributes☆19Updated 4 months ago
- A Collection of High Performance Parallel Skeletons for Tree Search Problems☆22Updated 10 months ago
- An open implementation of the MC family of maximum clique algorithms☆11Updated 8 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- The CP solver Chuffed☆20Updated 8 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 4 months ago
- C++ library for semigroups and monoids☆46Updated this week
- MaxJ and C/C++ library and utilities for Maxeler Dataflow Engines☆13Updated 6 years ago
- C++11 Message Passing☆74Updated 2 years ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated this week
- LaTeX Styles provided by Dagstuhl Publishing☆35Updated 4 months ago
- Fast combinatorics in C++ using SSE/AVX instruction sets☆15Updated last week
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- OpenPLS: An open phased local search (PLS) implementation☆9Updated 5 years ago
- Library for finding maximum cliques on graphs☆15Updated 3 years ago
- Lattice-based integer linear programming solver☆65Updated 3 years ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 6 years ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆51Updated last year
- Generate pgfplots or gnuplots from embedded SQL statements☆27Updated 7 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆423Updated last month
- MaxHS: a hybrid Maxsat solver developed by Jessica Davies and Fahiem Bacchus☆26Updated 3 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆46Updated this week
- ☆29Updated last week