jwalteros / dOmegaLinks
Library for finding maximum cliques on graphs
☆17Updated 4 years ago
Alternatives and similar repositories for dOmega
Users that are interested in dOmega are comparing it to the libraries listed below
Sorting:
- An open implementation of the MC family of maximum clique algorithms☆12Updated 9 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆473Updated 2 weeks ago
- GBBS: Graph Based Benchmark Suite☆216Updated last month
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆61Updated last year
- Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup☆22Updated 2 years ago
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 5 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated last week
- ☆12Updated 8 years ago
- COIN-OR Linear Programming Solver☆481Updated 3 weeks ago
- VieCut 1.00 - Shared-memory Minimum Cuts☆46Updated 2 years ago
- A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#☆92Updated last year
- Parallel Graph Input Output☆18Updated 2 years ago
- A C++ Framework for Optimization☆36Updated this week
- Parallel Maximum Clique Library☆119Updated 2 years ago
- KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…☆506Updated 3 weeks ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- Parallel Presolve for Integer and Linear Optimization☆40Updated 4 years ago
- Graph Coarsening and Partitioning Library☆33Updated 5 years ago
- Parallel Presolve for Integer and Linear Optimization☆84Updated last week
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆47Updated 2 weeks ago
- Resources on the GraphBLAS standard for graph algorithms in the language of linear algebra☆201Updated 2 months ago
- Branch-Cut-Price Framework☆31Updated 5 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated last week
- Discorde TSP is an easy-to-use API for Concorde TSP solver in C and C++ programming languages☆20Updated 7 years ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 5 months ago
- A harness for building the bundled suite of interoperable optimization tools available in the COIN-OR repository.☆135Updated 4 years ago
- ☆32Updated 2 years ago
- OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆90Updated 4 months ago
- An exact algorithm for the maximum clique problem (MCP) which improves over state-of-the-art approaches in some cases by orders of magnit…☆14Updated 2 months ago