GRAIL: A Scalable Index for Reachability Queries in Very Large Graphs
-
Updated
May 27, 2015 - C++
GRAIL: A Scalable Index for Reachability Queries in Very Large Graphs
DAGGER: Reachability Index for Dynamic Graphs
Reproducing the SIGMOD paper "Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs"
Probabilistic s-t reachability on large dynamic uncertain graphs: the DBL index extended with Hoeffding-bounded Monte Carlo sampling. Header-only C++17.
To associate your repository with the graph-indexing topic, visit your repo's landing page and select "manage topics."