Gregable / pq-treesLinks
General implementation of the PQ Tree algorithm.
☆28Updated 14 years ago
Alternatives and similar repositories for pq-trees
Users that are interested in pq-trees are comparing it to the libraries listed below
Sorting:
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated this week
- FOundation of stXXl and thriLL☆14Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Updated 7 months ago
- Maximum independent sets and vertex covers of large sparse graphs.☆79Updated 3 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆137Updated 2 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆47Updated this week
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Updated 3 months ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 9 months ago
- Succinct Data Structure Library 3.0☆101Updated last month
- Dynamic succinct/compressed data structures☆114Updated last month
- Sequential object-oriented simPlex☆75Updated last week
- The Chuffed CP solver☆119Updated 3 weeks ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆157Updated last year
- Fast Fast Hadamard Transform☆89Updated 4 years ago
- Efficient Prefix-Sum data structures in C++.☆26Updated 2 years ago
- This is a library plus a test harness for collecting algorithms that use the GraphBLAS. For test coverage reports, see https://graphblas…☆262Updated last week
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆470Updated this week
- Compact Data Structures Library☆103Updated 3 years ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Updated 3 years ago
- ☆17Updated 10 months ago
- Bloom-filter based minimal perfect hash function library☆271Updated 6 months ago
- Succinct data structures in C/C++☆92Updated last year
- TU DOrtmund lossless COMPression framework☆19Updated last year
- ☆22Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- GBBS: Graph Based Benchmark Suite☆215Updated last month
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago