A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
A variety of applications spanning various domains, e.g., social networks, transportation, and bioinformatics, have graphs as firstclass 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 social networks, one may need to compute the shortest path between two persons on a sub-graph containing only family relationships. This paperdoi:10.1145/2882903.2882933 dblp:conf/sigmod/HassanAA16 fatcat:mzadlwelxjgdjmlz36wprgls6i