4 citations · 12 across the 9 of their papers we have counts for
5 papers · 1 filter
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…
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…
Compound Binary Search Tree and Algorithms
Yong Tan
The Binary Search Tree (BST) is average in computer science which supports a compact data structure in memory and oneself even conducts a row of quick algorithms, by which people o…
Find an Optimal Path in Static System and Dynamical System within Polynomial Runtime
Yong Tan
We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discus…
Analyzing Traffic Problem Model With Graph Theory Algorithms
Yong Tan
This paper will contribute to a practical problem, Urban Traffic. We will investigate those features, try to simplify the complexity and formulize this dynamic system. These conten…