Hespian / EdgeHierarchiesLinks
More Hierarchy in Route Planning Using Edge Hierarchies
☆14Updated 5 years ago
Alternatives and similar repositories for EdgeHierarchies
Users that are interested in EdgeHierarchies are comparing it to the libraries listed below
Sorting:
- ☆17Updated 4 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆40Updated 2 weeks ago
- This repository contains C++ source code used in several publications in the area of route planning.☆38Updated 4 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- ☆9Updated 6 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆43Updated this week
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆31Updated 11 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- ☆21Updated 4 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆110Updated 6 months ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆440Updated 2 months ago
- Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.☆12Updated 2 weeks ago
- Master's thesis project involving label-constrained reachability (LCR)☆1Updated 4 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 3 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated last month
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆134Updated 2 years ago
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆47Updated 6 years ago
- Vienna Graph Clustering☆16Updated 6 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…☆10Updated 2 years ago
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago
- FOundation of stXXl and thriLL☆14Updated last year
- Parallel Balanced Binary Tree Structures☆117Updated 4 months ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 3 months ago
- Templated Portable I/O Environment☆113Updated 2 months ago
- Packed and Compressed Hash Tables☆15Updated 3 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 10 months ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago