A new upper bound on the complexity of the all pairs shortest path problem-Reference-Cited by-同舟云学术

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

A new upper bound on the complexity of the all pairs shortest path problem

Published:1992-09 Issue:4 Volume:43 Page:195-199
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Takaoka Tadao

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference11 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. Data Structures and Algorithms;Aho,1983

3. On the exponent of the all pairs shortest path problem;Alon;Proc. 32nd Ann. Symp. on Foundations of Computer Science,1992

4. The Design and Analysis of Parallel Algorithms;Akl,1989

5. Parallel matrix and graph algorithms;Dekel;SIAM J. Comput.,1981

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

1. Nearly Optimal Fault Tolerant Distance Oracle;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs;Mathematics;2023-11-28

3. The FastMap Pipeline for Facility Location Problems;PRIMA 2022: Principles and Practice of Multi-Agent Systems;2022-11-12

4. Deterministic APSP, Orthogonal Vectors, and More;ACM Transactions on Algorithms;2021-01-31

5. Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time;SIAM Journal on Computing;2021-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP