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
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆35Updated last week
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 2 months ago
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆76Updated 6 years ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆112Updated last year
• athomo / kcore
  ☆11Updated 7 years ago
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆57Updated 8 months ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆28Updated 9 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆202Updated last month
• heldstephan / exactcolors
  Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
  ☆13Updated 2 years ago
• tpet / lemon
  LEMON Graph Library
  ☆34Updated 5 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆21Updated last year
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆413Updated this week
• 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 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 3 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 2 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• wheatman / Packed-Memory-Array
  ☆15Updated last month
• linhongseba / MaximumClique
  The implementation for maximum clique enumeration algorithm
  ☆11Updated 8 years ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 2 years ago
• humayunk1 / PKC
  Parallel k-core Decomposition on Multicore Platforms
  ☆11Updated 4 years ago
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆81Updated 7 months ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 2 months ago
• tomtseng / dynamic-connectivity-hdt
  Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
  ☆18Updated last year
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆72Updated this week
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• shaowei-cai-group / Local-ILP
  A standalone local search solver for general integer linear programming
  ☆16Updated 6 months ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆50Updated last year
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago