Name
Title | ||
|---|---|---|
A new exact algorithm for the shortest path problem: An optimized shortest distance matrix |
Abstract | ||
|---|---|---|
AbstractHighlights •A new shortest distance matrix (SDM) algorithm is proposed.•The SDM algorithm adopts The Power-plus Operation defined by us.•The SDM algorithm can be used to solve the shortest path problem.•The SDM can compute vertices independently and process them in parallel.•In incomplete graphs, the efficiency of SDM algorithm is greatly improved. AbstractThe growing amount of data generated from the increasingly sophisticated network connections requires greater accuracy and higher efficiency in pinpointing the shortest paths concerned. Therefore, the earlier classical exact algorithms are no longer 100 percent suitable for large-scale data processing, for their known great time complexity during calculation. In this paper, We present an updated shortest distance matrix (SDM) algorithm. Evidence to the operation's properties is provided and the properties are used in subsequent optimizations. Compared with Dijkstra's algorithm and Floyd's algorithm, the optimized SDM algorithm with parallel mode makes a great improvement in shortening the running time. The data test shows that the new algorithm improves the efficiency in processing a large amount of data. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.cie.2021.107407 | Periodicals |
Keywords | DocType | Volume |
Graph theory, Shortest path, Multiple pairs, Algebraic method, Shortest distance matrix | Journal | 158 |
Issue | ISSN | Citations |
C | 0360-8352 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huilin Yuan | 1 | 0 | 0.34 |
| Jianlu Hu | 2 | 0 | 0.34 |
| Yufan Song | 3 | 0 | 0.34 |
| Yanke Li | 4 | 0 | 0.34 |
| Jie Du | 5 | 0 | 0.34 |