All-pairs shortest-paths computation in the presence of negative cycles

被引：2

作者：

Mehlhorn, K ^{[1
]}

Priebe, V ^{[1
]}

Schäfer, G ^{[1
]}

Sivadasan, N ^{[1
]}

机构：

[1] Max Planck Inst Informat, D-66123 Saarbrucken, Germany

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 81卷 / 06期

关键词：

graph algorithms; shortest-paths algorithms;

D O I：

10.1016/S0020-0190(01)00242-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present an algorithm that solves the all-pairs shortest-paths problem on a directed graph with n vertices and m arcs in time O(nm + n(2) logn), where the arcs are assigned real, possibly negative costs. Our algorithm is new in the following respect. It computes the distance mu(v, w) between each pair v, w of vertices even in the presence of negative cycles, where mu(v, w) is defined as the infimum of the costs of all directed paths from v to w. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：341 / 343

页数：3

共 50 条

[1] A blocked all-pairs shortest-paths algorithm
Venkataraman, G
Sahni, S
Mukhopadhyaya, S
ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 419 - 432
[2] A symbolic approach to the all-pairs shortest-paths problem
Sawitzki, D
GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 154 - 167
[3] All-pairs shortest paths computation in the BSP model
Tiskin, A
AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 178 - 189
[4] External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs
Arge, L
Meyer, U
Toma, L
AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 146 - 157
[5] Hardware/software integration for FPGA-based All-Pairs Shortest-Paths
Bondhugula, Uday
Devulapalli, Ananth
Dinan, James
Fernando, Joseph
Wyckoff, Pete
Stahlberg, Eric
Sadayappan, P.
FCCM 2006: 14TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2006, : 152 - +
[6] Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles
Thorup, M
ALGORITHM THEORY- SWAT 2004, 2004, 3111 : 384 - 396
[7] FB-APSP: A new efficient algorithm for computing all-pairs shortest-paths
Pereira Junior, Dyson
Gomes Wille, Emilio Carlos
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2018, 121 : 33 - 43
[8] All-pairs almost shortest paths
Dor, D
Halperin, S
Zwick, U
SIAM JOURNAL ON COMPUTING, 2000, 29 (05) : 1740 - 1759
[9] External-Memory Exact and Approximate All-Pairs Shortest-Paths in Undirected Graphs
Chowdhury, Rezaul Alam
Ramachandran, Vijaya
PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 735 - 744
[10] Solving All-Pairs Shortest-Paths Problem in Large Graphs Using Apache Spark
Schoeneman, Frank
Zola, Jaroslaw
PROCEEDINGS OF THE 48TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP 2019), 2019,

← 1 2 3 4 5 →