.png){kind=icon}
.png){kind=icon}
Return
Graph spanners: A tutorial review
.png){kind=icon}
OA
AI
DOI：10.1016/j.cosrev.2020.100253.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This survey provides a guiding reference to researchers seeking an overview of the large body of literature about graph spanners. It surveys 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. (c) 2020 Elsevier Inc. All rights reserved.
Keywords:
DISTANCE ORACLES
SPARSE SPANNERS
LOWER BOUNDS
ALGORITHM
TIME
CONSTRUCTIONS
TREE
HARDNESS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12.7
Papers:
2.3K
Citations:
5.2K