An optimal algorithm for L1 shortest paths in unit-disk graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An optimal algorithm for L1 shortest paths in unit-disk graphs

Published:2023-03 Issue: Volume:110 Page:101960
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Wang Haitao,Zhao Yiming

Funder

National Science Foundation

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference19 articles.

1. Decomposable searching problems;Bentley;Inf. Process. Lett.,1979

2. Shortest paths in intersection graphs of unit disks;Cabello;Comput. Geom. Theory Appl.,2015

3. All-pairs shortest paths in unit-disk graphs in slightly subquadratic time;Chan,2016

4. Approximate shortest paths and distance oracles in weighted unit-disk graphs;Chan,2018

5. Unit disk graphs;Clark;Discrete Math.,1990

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP