Alternatives and similar repositories for open-pls

Users that are interested in open-pls are comparing it to the libraries listed below

• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated 2 months ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆14Updated 5 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 4 months ago
• kit-algo / flow-cutter
  Experimental FlowCutter Code
  ☆12Updated 6 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated last week
• marvinwilliams / multiqueue
  ☆17Updated 2 months ago
• 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
• ankushmandal / topkapi
  ☆15Updated 6 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated 3 weeks ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆76Updated 2 months ago
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• vbuchhold / routing-framework
  This repository contains C++ source code used in several publications in the area of route planning.
  ☆38Updated 3 years ago
• 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
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• bingmann / sqlplot-tools
  Generate pgfplots or gnuplots from embedded SQL statements
  ☆27Updated 3 weeks ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated 2 months ago
• wata-orz / vertex_cover
  vertex cover solver
  ☆30Updated 5 years ago
• VieCut / VieCut
  VieCut 1.00 - Shared-memory Minimum Cuts
  ☆45Updated 2 years ago
• martin-steinegger / setcover
  linear (time,space) greedy set cover implementation
  ☆30Updated 3 years ago
• bjoern-andres / graph
  Graphs and Graph Algorithms in C++, including Minimum Cost (Lifted) Multicuts
  ☆238Updated last year
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 8 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆133Updated last year
• mayerrn / HYPE
  Implementation of the HYPE hypergraph partitioner.
  ☆19Updated 5 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year