1 paper
Kirill Simonov, Farehe Soheil, Shaily Verma
For a given graph G and a subset of vertices S, a \emph{distance preserver} is a subgraph of G that preserves shortest paths between the vertices of S. We distinguish betwe…