4 citations · 12 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 4 cited
A New Shortest Path Algorithm Generalized on Dynamic Graph for Commercial Intelligent Navigation for Transportation Management
Yong Tan
Dynamic graph research is an essential subject in Computer Science. The shortest path problem is still the central in this field; moreover there is a variety of applications in pra…
cs.DS2019★ 1 cited
Solve For Shortest Paths Problem Within Logarithm Runtime
Yong Tan
The Shortest Paths Problem (SPP) is no longer unresolved. Just for a large scalar of instance on this problem, even we cannot know if an algorithm achieves the computing. Those cut…