alex-87 / HyperGraphLib
C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.
☆21Updated 2 years ago
Alternatives and similar repositories for HyperGraphLib:
Users that are interested in HyperGraphLib are comparing it to the libraries listed below
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆133Updated last year
- Modeling and Programming with Gecode☆45Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.☆66Updated 2 years ago
- CP 2015 subgraph isomorphism experiments, data and paper☆13Updated 9 years ago
- High-Performance Streaming Graph Analytics on GPUs☆31Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated 3 months ago
- FOundation of stXXl and thriLL☆14Updated last year
- The Pseudo-Boolean Solver MiniSat+☆27Updated 12 years ago
- ☆21Updated 3 years ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆50Updated last year
- Boost.org graph_parallel module☆28Updated 2 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- C++11 library for fast fuzzy searching☆14Updated 9 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated 2 weeks ago
- Learned Monotone Minimal Perfect Hashing☆25Updated 2 months ago
- ☆15Updated 6 years ago
- A C++ library for summarizing data streams☆24Updated 5 years ago
- This repository contains components that will support percolation via OpenCL and CUDA☆31Updated 3 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Hornet data structure for sparse dynamic graphs and matrices☆82Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 5 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- C++ heterogeneous and lock-free containers☆13Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 2 weeks ago
- Dynamic data structure for sparse graphs.☆29Updated 10 months ago
- A fast generic C++ library for applied and computational topology☆58Updated 8 years ago