jwalteros / dOmega
Library for finding maximum cliques on graphs
☆15Updated 3 years ago
Alternatives and similar repositories for dOmega:
Users that are interested in dOmega are comparing it to the libraries listed below
- An open implementation of the MC family of maximum clique algorithms☆11Updated 8 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 3 months ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 3 years ago
- An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…☆57Updated 9 months ago
- Parallel k-core Decomposition on Multicore Platforms☆11Updated 4 years ago
- Quickly compute all maximal cliques of a graph☆76Updated 6 years ago
- LEMON Graph Library☆36Updated 5 years ago
- A standalone local search solver for general integer linear programming☆16Updated 7 months ago
- Parallel Presolve for Integer and Linear Optimization☆40Updated 3 years ago
- ☆11Updated 7 years ago
- A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#☆81Updated 8 months ago
- VieCut 1.00 - Shared-memory Minimum Cuts☆43Updated 2 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Cut Generator Library☆25Updated last week
- binary/integer linear programming solver☆15Updated 2 months ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup☆18Updated last year
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆138Updated last week
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 3 years ago
- CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.☆22Updated 3 years ago
- A solver based on local search☆11Updated 7 months ago
- Branch-Cut-Price Framework☆28Updated 4 years ago
- Parallel Maximum Clique Library☆114Updated last year
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆418Updated last week
- A solver based on column generation☆26Updated last month
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago