Alternatives and similar repositories for flow-cutter

Users that are interested in flow-cutter are comparing it to the libraries listed below

• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 5 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆433Updated 3 weeks ago
• VieClus / VieClus
  Vienna Graph Clustering
  ☆16Updated 4 months ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆38Updated this week
• VieCut / VieCut
  VieCut 1.00 - Shared-memory Minimum Cuts
  ☆45Updated 2 years ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆113Updated 3 weeks ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆74Updated last month
• molaupi / karri
  Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
  ☆12Updated last week
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• tpet / lemon
  LEMON Graph Library
  ☆39Updated 5 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• pthimon / clustering
  Library for performing spectral clustering in C++
  ☆78Updated last year
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆133Updated last year
• yan-qi / k-shortest-paths-cpp-version
  An implementation of the k-shorest-paths algorithm in Cpp
  ☆74Updated 3 years ago
• marvinwilliams / multiqueue
  ☆17Updated 2 months ago
• SethosII / cuda-revised-simplex
  An implementation of the revised simplex algorithm in CUDA for solving linear optimization problems in the form max{c*x | A*x=b, l<=x<=u}
  ☆27Updated 8 years ago
• ycollet / coinor-cmake
  CMake files for compiling CoinOr projects
  ☆31Updated 4 years ago
• mloskot / spatial_index_benchmark
  Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…
  ☆47Updated 5 years ago
• scipopt / soplex
  Sequential object-oriented simPlex
  ☆64Updated last month
• leotac / ELPP-IP
  Solving Elementary Longest/Shortest Path problems with Integer Programming
  ☆14Updated 8 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆53Updated last year
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• niklas-uhl / katric
  KaTric: scalable distributed-memory triangle counting made in Karlsruhe
  ☆13Updated last year
• ryanjoneil / tsppd-hybrid
  Hybrid optimization code for solving TSPPDs
  ☆10Updated 6 years ago
• lorenzhs / wrs
  Parallel Weighted Random Sampling
  ☆20Updated 4 years ago
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆140Updated this week
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆38Updated 2 weeks ago
• bolner / SimplexSolver
  An easy-to-use Simplex solver class for linear programming.
  ☆20Updated 7 years ago
• DNCrane / Cover-Tree
  A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…
  ☆62Updated 7 years ago
• bingmann / sqlplot-tools
  Generate pgfplots or gnuplots from embedded SQL statements
  ☆27Updated last week