4 citations · 12 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DM2016
Generic and Efficient Solution Solves the Shortest Paths Problem in Square Runtime
Yong Tan
We study a group of new methods to solve an open problem that is the shortest paths problem on a given fix-weighted instance. It is the real significance at a considerable altitude…
cs.DS2016★ 1 cited
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…