Routing Optimization Algorithms Based on Node Compression in Big Data Environment
Shortest path problem has been a classic issue. Even more so difficulties remain involving large data environment. Current research on shortest path problem mainly focuses on seeking the shortest path from a starting point to the destination, with both vertices already given; but the researches of s...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2017-01-01
|
| Series: | Scientific Programming |
| Online Access: | http://dx.doi.org/10.1155/2017/2056501 |