.png){kind=icon}
返回
Graph spanners: A tutorial review
.png){kind=icon}
OA
AI
DOI：10.1016/j.cosrev.2020.100253.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
DISTANCE ORACLES
SPARSE SPANNERS
LOWER BOUNDS
ALGORITHM
TIME
CONSTRUCTIONS
TREE
HARDNESS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.7
论文数:
2.3K
被引数:
5.2K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容