A variety of applications spanning various domains, e.g., social networks, transportation, and bioinformatics, have graphs as first-class citizens. These applications share a vital operation, namely, finding the shortest path between two nodes. In many scenarios, users are interested in filtering the graph before finding the shortest path. For example, in… (More)

@inproceedings{Hassan2016GraphIF,
title={Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs},
author={Mohamed S. Hassan and Walid G. Aref and Ahmed M. Aly},
booktitle={SIGMOD Conference},
year={2016}
}