ARROW: Approximating Reachability using Random walks Over Web scale graphs
-
Updated
Feb 19, 2019 - C++
ARROW: Approximating Reachability using Random walks Over Web scale graphs
Solved tasks of "Randomized Algorithms" university course, contains implementations of main randomized algorithms.
This repository contains a reachability checker for reachability games created in the Advanced Programming (Software, MSc.) course at AAU.
DAGGER: Reachability Index for Dynamic Graphs
A reference implementation of PDR for boolean transition systems
GRAIL: A Scalable Index for Reachability Queries in Very Large Graphs
Add a description, image, and links to the reachability topic page so that developers can more easily learn about it.
To associate your repository with the reachability topic, visit your repo's landing page and select "manage topics."