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
  ☆12Updated 8 years ago
• INFORMSJoC / INFORMSJoC.github.io
  This is the Web site associated with the repository for hosting software and data associated with papers appearing in the INFORMS Journal…
  ☆19Updated last week
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆78Updated 6 years ago
• heldstephan / exactcolors
  Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
  ☆13Updated 2 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated this week
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆74Updated last month
• athomo / kcore
  ☆11Updated 7 years ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆14Updated last year
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆59Updated last year
• tpet / lemon
  LEMON Graph Library
  ☆39Updated 5 years ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆85Updated 11 months ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• coin-or / Bcp
  Branch-Cut-Price Framework
  ☆30Updated 4 years ago
• thserra / MIPLIBing
  ☆31Updated last year
• shaowei-cai-group / Local-MIP
  A standalone local search solver for general mixed integer programming
  ☆22Updated 2 months ago
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆19Updated last year
• Adam27X / hybrid_BC
  Hybrid methods for Parallel Betweenness Centrality on the GPU
  ☆24Updated 6 years ago
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 10 months ago
• VieCut / VieCut
  VieCut 1.00 - Shared-memory Minimum Cuts
  ☆45Updated 2 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆433Updated 3 weeks ago
• fabiofurini / B-P_BinPackingProblem
  Branch-and-Price Algorithm for the Bin Packing Problem (using CPLEX as pricer and LP solver). It implements a Ryan-Foster branching schem…
  ☆16Updated 6 years ago
• HPCGraphAnalysis / PuLP
  ☆24Updated 2 years ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆29Updated last month
• alberto-santini / maritime-vrp
  Branch-and-price solver for the Feeder Network Design Problem
  ☆36Updated 2 years ago