Alternatives and similar repositories for dOmega:

Users that are interested in dOmega are comparing it to the libraries listed below

• darrenstrash / open-mcs
  An open implementation of the MC family of maximum clique algorithms
  ☆11Updated 8 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 4 months ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• heldstephan / exactcolors
  Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
  ☆13Updated 2 years ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆28Updated 4 years ago
• hlefebvr / idol
  A C++ Framework for Optimization
  ☆33Updated this week
• athomo / kcore
  ☆11Updated 7 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆78Updated 6 years ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆115Updated last year
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆83Updated 9 months ago
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆58Updated 10 months ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆13Updated last year
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated 11 months ago
• wheatman / Packed-Memory-Array
  ☆17Updated 3 months ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• Xtra-Computing / PathEnum
  Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…
  ☆14Updated 4 years ago
• humayunk1 / PKC
  Parallel k-core Decomposition on Multicore Platforms
  ☆11Updated 4 years ago
• tomtseng / dynamic-connectivity-hdt
  Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
  ☆19Updated last year
• lgottwald / PaPILO
  Parallel Presolve for Integer and Linear Optimization
  ☆40Updated 3 years ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆18Updated last year
• coin-or / Csdp
  This is the working repository for the CSDP project. CSDP is a solver for semidefinite programming problems. It is a COIN-OR project.
  ☆58Updated 2 years ago
• Olibear / ArcRoutingLibrary
  A collection of problem abstractions and solver implementations for arc-routing problems
  ☆25Updated 4 years ago
• heldstephan / jpt-amz
  ☆60Updated 7 months ago
• andremaravilha / discorde-tsp
  Discorde TSP is an easy-to-use API for Concorde TSP solver in C and C++ programming languages
  ☆20Updated 6 years ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 3 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• acco93 / filo
  A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.
  ☆48Updated last year
• fabiofurini / LocationCovering
  Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem
  ☆15Updated 2 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆425Updated last week