MengxuanZhang1 / DynamicShortestPath_VLDB21Links
☆11Updated last year
Alternatives and similar repositories for DynamicShortestPath_VLDB21
Users that are interested in DynamicShortestPath_VLDB21 are comparing it to the libraries listed below
Sorting:
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆158Updated last year
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- Graph Partitioning for Large-scale Graph Datasets☆97Updated 3 years ago
- a k-cliques algorithm☆19Updated 3 years ago
- A Distributed GNN system☆116Updated 9 months ago
- Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…☆33Updated 2 years ago
- ☆27Updated 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…☆50Updated 2 years ago
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆13Updated 10 months ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- ☆15Updated 2 months ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆30Updated 3 years ago
- Fast and exact shortest-path distance querying index☆90Updated 11 years ago
- Ant Graph Learning (AGL) provides a comprehensive solution for graph learning tasks at an industrial scale.☆87Updated last year
- A Factored System for Sample-based GNN Training over GPUs☆42Updated last year
- Official code of our work, VCSR: Mutable CSR Graph Format Using Vertex-Centric Packed Memory Array [CCGrid 2022].☆12Updated 3 years ago
- ☆31Updated 4 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆31Updated 9 years ago
- ☆9Updated last year
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- A framework of aggregating huge-scale graph based on metis algorithm.☆18Updated 4 years ago
- A scalable graph learning toolkit for extremely large graph datasets. (WWW'22, 🏆 Best Student Paper Award)☆154Updated last year
- ☆11Updated last year
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated 11 months ago
- Source codes of "Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction", SIGMOD 2023☆14Updated last year
- ☆16Updated 8 months ago
- ☆27Updated 11 months ago
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆19Updated 3 years ago
- SoCC'20 and TPDS'21: Scaling GNN Training on Large Graphs via Computation-aware Caching and Partitioning.☆50Updated 2 years ago