DMGA: A Distributed Shortest Path Algorithm for Multistage Graph
The multistage graph problem is a special kind of single-source single-sink shortest path problem. It is difficult even impossible to solve the large-scale multistage graphs using a single machine with sequential algorithms. There are many distributed graph computing systems that can solve this prob...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Scientific Programming |
| Online Access: | http://dx.doi.org/10.1155/2021/6639008 |