Gregable / pq-treesLinks
General implementation of the PQ Tree algorithm.
☆29Updated 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:
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆41Updated this week
- FOundation of stXXl and thriLL☆14Updated last year
- ☆17Updated 8 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆45Updated last week
- 🔶 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
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- ☆22Updated 4 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- LibMVC is a collection of fast iterative minimum vertex cover solvers. Currently NuMVC and FastVC are implemented.☆12Updated 3 years ago
- LinBox - C++ library for exact, high-performance linear algebra☆97Updated last month
- GBBS: Graph Based Benchmark Suite☆214Updated 3 months ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆57Updated 2 years ago
- Sequential object-oriented simPlex☆70Updated last week
- Fast Fast Hadamard Transform☆86Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆50Updated 5 months ago
- Parallel Balanced Binary Tree Structures☆121Updated 8 months ago
- CPAM: Compressed Parallel Augmented Maps☆26Updated 3 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆130Updated 10 months ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 7 months ago
- A near-optimal exact sampler for discrete probability distributions☆57Updated 7 months ago
- Bloom-filter based minimal perfect hash function library☆269Updated 4 months 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 2 years ago
- Efficient Prefix-Sum data structures in C++.☆25Updated 2 years ago
- Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…☆31Updated this week
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Updated 2 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated 11 months ago
- Graph Coarsening and Partitioning Library☆33Updated 5 years ago