README.md

Time's ARROW

This repository is the implementation of algorithms described in the paper

Neha Sengupta, Amitabha Bagchi, Maya Ramanath, and Srikanta Bedathur, 
"ARROW: Approximating Reachability using Random walks Over Web-scale Graphs"
ICDE, 2019

Installation

To compile, use make[rr|bbfs|bfs][snapshot|persistent|chained] where rr stands for ARROW, bfs stands for the BFS baseline, and bbfs stands for the BBFS baseline.