Alternatives and similar repositories for pace-2019

Users that are interested in pace-2019 are comparing it to the libraries listed below

• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆76Updated last month
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 3 months ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 2 months ago
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated this week
• marvinwilliams / multiqueue
  ☆17Updated 2 months ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆66Updated this week
• kittobi1992 / cluster_editing
  KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…
  ☆10Updated 2 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated 3 weeks ago
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆39Updated this week
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• kit-algo / catchup
  Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"
  ☆10Updated 4 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆25Updated last year
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆435Updated last month
• kamping-site / kamping
  KaMPIng: (Near) zero-overhead MPI wrapper for modern C++
  ☆50Updated 2 weeks ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• ReStoreCpp / ReStore
  REplicated STORagE
  ☆13Updated 2 years ago
• Udopia / gbd
  Management of Benchmark Instances and Instance Attributes
  ☆20Updated last month
• datourat / Gorder
  ☆37Updated 5 years ago
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆464Updated 2 months ago
• bingmann / sqlplot-tools
  Generate pgfplots or gnuplots from embedded SQL statements
  ☆27Updated 3 weeks ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆210Updated 5 months ago
• ByteHamster / PaCHash
  Packed and Compressed Hash Tables
  ☆15Updated last month
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆15Updated 3 years ago
• ciaranm / glasgow-subgraph-solver
  A solver for subgraph isomorphism problems, based upon a series of papers by subsets of McCreesh, Prosser, and Trimble.
  ☆81Updated this week
• scipopt / soplex
  Sequential object-oriented simPlex
  ☆64Updated last month