Alternatives and similar repositories for HyperGraphLib

Users that are interested in HyperGraphLib are comparing it to the libraries listed below

• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆135Updated 2 years ago
• andralex / MedianOfNinthers
  ☆49Updated 5 years ago
• gunrock / graphblast
  High-Performance Linear Algebra-based Graph Primitives on GPUs
  ☆227Updated 4 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆56Updated 2 years ago
• Gecode / MPG
  Modeling and Programming with Gecode
  ☆51Updated 2 years ago
• hornet-gt / hornet
  Hornet data structure for sparse dynamic graphs and matrices
  ☆87Updated 5 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• jwbuurlage / Bulk
  A modern interface for implementing bulk-synchronous parallel programs.
  ☆94Updated 2 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆117Updated 4 months ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆31Updated 4 months ago
• boostorg / graph
  Boost.org graph module
  ☆358Updated 3 weeks ago
• oluwatimilehin / anchors
  C++ library for incremental computing
  ☆22Updated 2 years ago
• kwonoh / glam
  GLAM: Graph Layout Aesthetic Metrics
  ☆39Updated last year
• BlairArchibald / YewPar
  A Collection of High Performance Parallel Skeletons for Tree Search Problems
  ☆22Updated last month
• stingergraph / stinger
  The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…
  ☆213Updated 7 months ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆80Updated 5 months ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• habanero-rice / hclib
  A C/C++ task-based programming model for shared memory and distributed parallel computing.
  ☆72Updated 5 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• master-keying / minisat
  A minimalistic and high-performance SAT solver
  ☆146Updated 3 years ago
• thomasmoelhave / tpie
  Templated Portable I/O Environment
  ☆113Updated 3 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 4 months ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆110Updated 7 months ago
• beniz / fiboheap
  C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.
  ☆68Updated 3 years ago
• alandefreitas / pareto
  Spatial Containers, Pareto Fronts, and Pareto Archives
  ☆99Updated last year
• wjakob / dset
  Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank
  ☆66Updated 10 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
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• boostorg / graph_parallel
  Boost.org graph_parallel module
  ☆31Updated 3 months ago