Skip to content

senguptaneha/temporalReachabilityC

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
Interval.cpp
Interval.cpp
 
 
Interval.h
Interval.h
 
 
IntervalNode.cpp
IntervalNode.cpp
 
 
IntervalNode.h
IntervalNode.h
 
 
IntervalSnapshot.cpp
IntervalSnapshot.cpp
 
 
IntervalTree.cpp
IntervalTree.cpp
 
 
IntervalTree.h
IntervalTree.h
 
 
IntervalTreeTest.cpp
IntervalTreeTest.cpp
 
 
Makefile
Makefile
 
 
Node.cpp
Node.cpp
 
 
README.md
README.md
 
 
Stop.cpp
Stop.cpp
 
 
Stop.h
Stop.h
 
 
TemporalEdge.cpp
TemporalEdge.cpp
 
 
TemporalEdge.h
TemporalEdge.h
 
 
TemporalGraph.cpp
TemporalGraph.cpp
 
 
TemporalGraph.h
TemporalGraph.h
 
 
TemporalMain.cpp
TemporalMain.cpp
 
 
TemporalNode.cpp
TemporalNode.cpp
 
 
TemporalNode.h
TemporalNode.h
 
 
TemporalNodeInterval.cpp
TemporalNodeInterval.cpp
 
 
TrieTable.cpp
TrieTable.cpp
 
 
arrowDyn.c
arrowDyn.c
 
 
baseline.cpp
baseline.cpp
 
 
baseline1.cpp
baseline1.cpp
 
 
bbfs.cpp
bbfs.cpp
 
 
bbfsChained.cpp
bbfsChained.cpp
 
 
bbfsPersistent.cpp
bbfsPersistent.cpp
 
 
bbfsSnapshot.cpp
bbfsSnapshot.cpp
 
 
bfsChained.cpp
bfsChained.cpp
 
 
bfsPersistent.cpp
bfsPersistent.cpp
 
 
bfsPersistent1.cpp
bfsPersistent1.cpp
 
 
bfsSnapshot.cpp
bfsSnapshot.cpp
 
 
bfsSnapshotC.cpp
bfsSnapshotC.cpp
 
 
main.cpp
main.cpp
 
 
reachabilityBBFS.c
reachabilityBBFS.c
 
 
reachabilityBFS.c
reachabilityBFS.c
 
 
rrChained.cpp
rrChained.cpp
 
 
rrPersistent.cpp
rrPersistent.cpp
 
 
rrPersistentBkup.cpp
rrPersistentBkup.cpp
 
 
rrSnapshot.cpp
rrSnapshot.cpp
 
 
runARROWDyn.sh
runARROWDyn.sh
 
 
runBBfsAll.sh
runBBfsAll.sh
 
 
runBfsAll.sh
runBfsAll.sh
 
 
runRRAll.sh
runRRAll.sh
 
 
runRRParams.sh
runRRParams.sh
 
 

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

reachability random-walk dynamic-graphs temporal-graphs

Resources

Readme
Activity

Stars

3 stars

Watchers

0 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages