Estimating all pairs shortest paths in restricted graph families: a unified approach-Reference-Cited by-同舟云学术

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

Estimating all pairs shortest paths in restricted graph families: a unified approach

Published:2005-09 Issue:1 Volume:57 Page:1-21
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Dragan Feodor F.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference47 articles.

1. Fast estimation of diameter and shortest paths (without matrix multiplications);Aingworth;SIAM J. Comput.,1999

2. On the exponent of the all pairs shortest path problem;Alon,1991

3. Optimal link path queries in a simple polygon;Arkin,1992

4. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications;Atallah,1993

5. Near-linear cost sequential and distributed constructions of sparse neighborhood covers;Awerbuch,1993

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Accelerating all-pairs shortest path algorithms for bipartite graphs on graphics processing units;Multimedia Tools and Applications;2022-02-09

2. Fast Diameter Computation Within Split Graphs;Combinatorial Optimization and Applications;2019

3. Fast Approximation of Centrality and Distances in Hyperbolic Graphs;Combinatorial Optimization and Applications;2018

4. A survey of the all-pairs shortest paths problem and its variants in graphs;Acta Universitatis Sapientiae, Informatica;2016-06-01

5. An all-pairs shortest path algorithm for bipartite graphs;Open Computer Science;2013-01-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP