Skip to content

ARROW: Approximating Reachability using Random walks Over Web scale graphs

Notifications You must be signed in to change notification settings

senguptaneha/temporalReachabilityC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

About

ARROW: Approximating Reachability using Random walks Over Web scale graphs

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published