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
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated 3 weeks ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• GT-TDAlab / PIGO
  Parallel Graph Input Output
  ☆19Updated last year
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆76Updated 2 months ago
• ucrparlay / Parallel-SSSP
  SPAA'21: Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
  ☆19Updated 9 months ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆436Updated last month
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• laser-ufpb / CVRPController
  CVRPController is used to run and calculate score for the 12th DIMACS Implementation Challenge: CVRP track.
  ☆22Updated 3 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• heldstephan / exactcolors
  Exactcolors is a collection of algorithms for exactly solving graph coloring and weighted stable set problems.
  ☆13Updated 2 years ago
• torressa / cspy
  A collection of algorithms for the (Resource) Constrained Shortest Path problem in Python / C++ / C#
  ☆85Updated 11 months ago
• tomtseng / dynamic-connectivity-hdt
  Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup
  ☆20Updated last year
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆25Updated last year
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• athomo / kcore
  ☆12Updated 7 years ago
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆59Updated last year
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆24Updated 8 months ago
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆142Updated this week
• lgottwald / PaPILO
  Parallel Presolve for Integer and Linear Optimization
  ☆40Updated 3 years ago
• Xtra-Computing / G3
  G3: A Programmable GNN Training System on GPU
  ☆43Updated 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
• Algebraic-Programming / ALP
  Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…
  ☆25Updated this week
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆116Updated last year
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago