dilsonpereira / Minimum-Cost-Perfect-MatchingLinks
C++ implementation of algorithms for finding perfect matchings in general graphs
☆71Updated 3 years ago
Alternatives and similar repositories for Minimum-Cost-Perfect-Matching
Users that are interested in Minimum-Cost-Perfect-Matching are comparing it to the libraries listed below
Sorting:
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆443Updated 4 months ago
- Concorde is a computer code for the symmetric traveling salesman problem (TSP) and some related network optimization problems. It was cre…☆97Updated 3 years ago
- Parallel Maximum Clique Library☆116Updated 2 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated last week
- Maximum independent sets and vertex covers of large sparse graphs.☆78Updated last month
- Sequential object-oriented simPlex☆70Updated last week
- SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with native CMake support☆53Updated 2 months ago
- Parallel, batch-dynamic kdtree☆13Updated 3 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆152Updated this week
- VieCut 1.00 - Shared-memory Minimum Cuts☆45Updated 2 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆482Updated last month
- COIN-OR Linear Programming Solver☆458Updated last week
- CUDA implementation of the Blocked Floyd Warshall All pairs shortest path graph algorithm☆42Updated 7 years ago
- Python implementation of various max-cut problem solvers.☆20Updated 6 years ago
- An open implementation of the MC family of maximum clique algorithms☆12Updated 9 years ago
- A collection of min-cut/max-flow algorithms.☆49Updated 3 years ago
- Library for finding maximum cliques on graphs☆16Updated 3 years ago
- C++ implementation of sparse matrix using CRS (Compressed Row Storage) format☆122Updated 5 years ago
- OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆84Updated 2 months ago
- ☆35Updated 10 years ago
- A C++ wrapper for SCIP☆24Updated 6 months ago
- Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.☆22Updated 4 years ago
- Kd-Tree library for kNN and range queries in plain C++98☆93Updated last year
- Team J28 submission for the ROADEF/EURO Challenge 2018☆12Updated 5 years ago
- An evolutionary computation framework to (automatically) build fast parallel stochastic optimization solvers☆109Updated 4 months ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- vectorization of the kd-tree data structure and search algorithm☆41Updated 7 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- Simple C++ KD-Tree implementation☆221Updated 10 months ago
- A set of tools to solve TSP problems using the LKH solver☆99Updated 9 years ago