.png){kind=icon}
.png){kind=icon}
Return
Extending the Shortest Path Algorithm for Large Graphs with Cycles and Parallel Computing Capabilities
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-97648-3_13.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The challenge of finding the shortest path in graphs containing cycles and negative weights presents substantial difficulties across multiple fields, including transportation, social network analysis, and the study of complex systems. While sequential algorithms provide effective solutions for small to medium-sized graphs, they become impractical for large graphs due to constraints in processing time and computational resources. This paper presents an extension of the shortest path algorithm into a parallel computing environment, leveraging the power of modern multicore systems. Experimental results demonstrate that the parallel version achieves superior performance compared to traditional algorithms, making it suitable for handling large-scale graphs efficiently.
Keywords:
Parallel Algorithm
Shortest Path
Negative Weights
Graphs with Cycles
Large Graphs
Journal
C
IF:
0
Papers:
29
Citations:
0