Graph Spanners: A Tutorial Review
Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Mohammad, Javad Latifi Jebelli, Stephen Kobourov, Richard Spence
TL;DR
This tutorial review offers a comprehensive overview of graph spanners, covering formulations, properties, algorithms, and applications, along with open problems for future research.
Contribution
It provides a structured summary of existing literature on graph spanners and introduces open problems to guide future research.
Findings
Summarizes various formulations and properties of graph spanners.
Reviews algorithms and computational complexity results.
Lists open problems in the field.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.