iwiwi / pruned-landmark-labeling
Fast and exact shortest-path distance querying index
☆88Updated 10 years ago
Alternatives and similar repositories for pruned-landmark-labeling:
Users that are interested in pruned-landmark-labeling are comparing it to the libraries listed below
- ☆11Updated last year
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆29Updated 9 years ago
- Implementation of the graph partitioning algorithm described in paper "Graph Partitioning with Natural Cuts" in the 2011 IEEE Internation…☆25Updated 8 years ago
- shortest path query and kNN search on road network☆38Updated 7 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- ☆18Updated 3 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- Historical shortest-path distance querying index by pruned landmark labeling☆10Updated 10 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆149Updated last year
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- Trillion-edge Scale Graph Edge Partitioning☆26Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 3 years ago
- Graph Partitioning for Large-scale Graph Datasets☆93Updated 3 years ago
- Code and data for the Clustering Uncertain Graphs paper☆9Updated 2 years ago
- ☆11Updated 7 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 3 years ago
- GBBS: Graph Based Benchmark Suite☆202Updated last month
- A general-purpose, distributed graph random walk engine.☆111Updated last year
- ☆26Updated 2 years ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆46Updated last year
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆10Updated 4 months ago
- Edge-centric Graph Processing System using Streaming Partitions☆80Updated 7 years ago
- ☆28Updated 3 months ago
- Dynamic data structure for sparse graphs.☆28Updated 9 months ago
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆10Updated 3 years ago
- Codes of the paper "Time Constrained Continuous Subgraph Search Over Streaming Graphs. ICDE 2019: 1082-1093". Authors: Youhuan Li, Lei Zo…☆12Updated 3 years ago
- This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the exp…☆9Updated 8 months ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆85Updated 5 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago