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
• kamping-site / kassert
  Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…
  ☆11Updated 2 months ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 3 weeks ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆73Updated 2 weeks ago
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated last week
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆140Updated last week
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• 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
• marvinwilliams / multiqueue
  ☆17Updated last month
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆206Updated 4 months ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆428Updated this week
• kahypar / kahypar
  KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisect…
  ☆457Updated last month
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆19Updated 4 years ago
• Udopia / gbd
  Management of Benchmark Instances and Instance Attributes
  ☆19Updated last week
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆24Updated last year
• domschrei / mallob
  Malleable Load Balancer. Massively Parallel Logic Backend. Award-winning SAT solving for the cloud.
  ☆66Updated last week
• wheatman / Packed-Memory-Array
  ☆17Updated 4 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• jwalteros / dOmega
  Library for finding maximum cliques on graphs
  ☆15Updated 3 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆30Updated last year
• ReStoreCpp / ReStore
  REplicated STORagE
  ☆13Updated 2 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.
  ☆77Updated 2 months ago
• ByteHamster / GpuRecSplit
  Parallel space-efficient minimal perfect hash function on SIMD and GPU
  ☆14Updated 3 weeks ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• bingmann / sqlplot-tools
  Generate pgfplots or gnuplots from embedded SQL statements
  ☆27Updated 8 months ago
• MengxuanZhang1 / DynamicShortestPath_VLDB21
  ☆11Updated last year
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆19Updated 5 years ago