All Pairs Shortest Paths for Graphs with Small Integer Length Edges

Author:

Galil Zvi,Margalit Oded

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference6 articles.

1. N. Alon, Z. Galil, O. Margalit, On the exponent of all pairs shortest path problem, Proceedings, 32th Annual Symp. on Foundation of Comput. Sci, 1991

2. J. Comput. System Sci

3. Z. Galil, O. Margalit, All pairs shortest distances for graphs with small integer edge lengths

4. N. Alon, Z. Galil, O. Margalit, M. Naor, Witnesses for Boolean matrix multiplication and for shortest paths, Proceedings, 33rd Annual Symp. on Foundation of Comput. Sci. 1992

5. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings, 19th Annual Symp. on Theory of Computing, 1987

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

1. An Empirical Criterion for Transitive Closure of a Searchability Matrix;Lecture Notes in Networks and Systems;2023

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

3. Undirected (1+ )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work;Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures;2021-07-06

5. Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3