All pairs almost shortest paths

被引：18

|

作者：

Dor, D ^{[1
]}

Halperin, S ^{[1
]}

Zwick, U ^{[1
]}

机构：

[1] TEL AVIV UNIV,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL

来源：

37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1996年

关键词：

D O I：

10.1109/SFCS.1996.548504

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：452 / 461

页数：10

相关论文

共 50 条

[31] Incremental maintenance of all-pairs shortest paths in relational DBMSs
Greco S.
Molinaro C.
Pulice C.
Quintana X.
Social Network Analysis and Mining, 2017, 7 (1)
[32] A branch-checking algorithm for all-pairs shortest paths
Duin, C
ALGORITHMICA, 2005, 41 (02) : 131 - 145
[33] Fully dynamic all pairs shortest paths with real edge weights
Demetrescu, Camil
Italiano, Giuseppe F.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (05) : 813 - 837
[34] From Circuit Complexity to Faster All-Pairs Shortest Paths
Williams, R. Ryan
SIAM REVIEW, 2021, 63 (03) : 559 - 582
[35] All pairs shortest paths for graphs with small integer length edges
Galil, Z
Margalit, O
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 54 (02) : 243 - 254
[36] More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
Chan, Timothy M.
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 590 - 598
[37] A NEW ALGORITHM TO FIND THE SHORTEST PATHS BETWEEN ALL PAIRS OF NODES
GALLO, G
PALLOTTINO, S
DISCRETE APPLIED MATHEMATICS, 1982, 4 (01) : 23 - 35
[38] A Branch-Checking Algorithm for All-Pairs Shortest Paths
Cees Duin
Algorithmica , 2005, 41 : 131 - 145
[39] Near-Optimal Approximate Decremental All Pairs Shortest Paths
Chechik, Shiri
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 170 - 181
[40] MORE ALGORITHMS FOR ALL-PAIRS SHORTEST PATHS IN WEIGHTED GRAPHS
Chan, Timothy M.
SIAM JOURNAL ON COMPUTING, 2010, 39 (05) : 2075 - 2089

← 1 2 3 4 5 →