Semidynamic algorithms for maintaining single-source shortest path trees

被引：0

作者：

Frigioni, D.

Marchetti-Spaccamela, A.

Nanni, U.

机构：

来源：

Algorithmica (New York) | 1998年 / 22卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：250 / 274

共 50 条

[31] EFFICIENT DISTRIBUTED ALGORITHMS FOR SINGLE-SOURCE SHORTEST PATHS AND RELATED PROBLEMS ON PLANE NETWORKS
JANARDAN, R
CHENG, SW
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 486 : 133 - 150
[32] A randomized parallel algorithm for single-source shortest paths
Klein, PN
Subramanian, S
JOURNAL OF ALGORITHMS, 1997, 25 (02) : 205 - 220
[33] Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs
Henzinger, Monika
Krinninger, Sebastian
Nanongkai, Danupon
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2014, : 674 - 683
[34] A Faster Distributed Single-Source Shortest Paths Algorithm
Forster, Sebastian
Nanongkai, Danupon
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 686 - 697
[35] Algorithms for Single-Source Vertex Connectivity
Chuzhoy, Julia
Khanna, Sanjeev
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 105 - +
[36] A FORWARD-BACKWARD SINGLE-SOURCE SHORTEST PATHS ALGORITHM
Wilson, David B.
Zwick, Uri
SIAM JOURNAL ON COMPUTING, 2015, 44 (03) : 698 - 739
[37] Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Meyer, U
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2003, 48 (01): : 91 - 134
[38] Single-source shortest paths in the CONGEST model with improved bounds
Shiri Chechik
Doron Mukhtar
Distributed Computing, 2022, 35 : 357 - 374
[39] A forward-backward single-source shortest paths algorithm
Wilson, David B.
Zwick, Uri
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 707 - 716
[40] Shortest shortest path trees of a network
Hansen, P
Zheng, ML
DISCRETE APPLIED MATHEMATICS, 1996, 65 (1-3) : 275 - 284

← 1 2 3 4 5 →