This tutorial review provides a guiding reference to researchers who want to have an overview of the large body of literature about graph spanners. It reviews the current literature covering various research streams about graph spanners, such as different formulations, sparsity and lightness results, computational complexity, dynamic algorithms, and applications. As an additional contribution, we offer a list of open problems on graph spanners.
@article{arxiv.1909.03152,
title = {Graph Spanners: A Tutorial Review},
author = {Reyan Ahmed and Greg Bodwin and Faryad Darabi Sahneh and Keaton Hamm and Mohammad Javad Latifi Jebelli and Stephen Kobourov and Richard Spence},
journal= {arXiv preprint arXiv:1909.03152},
year = {2020}
}
Comments
Many more papers added from the previous version, as well as significant expansion of results presented