Better Distance Preservers and Additive Spanners
<jats:p> We study two popular ways to sketch the shortest path distances of an input graph. The first is <jats:italic>distance preservers</jats:italic> , which are sparse subgraphs that agree with the distances of the original graph on a given...
| Váldodahkkit: | , |
|---|---|
| Eará dahkkit: | |
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
Association for Computing Machinery (ACM)
2022
|
| Liŋkkat: | https://hdl.handle.net/1721.1/143945 |