Gupta, Manoj; Singh, Aditi
(Cornell University Library, 2018-05)
Given an undirected unweighted graph G and a source set S of |S|=? sources, we want to build a data structure which can process the following query {\sc Q}(s,t,e): find the shortest distance from s to t avoiding an edge ...