Author:
Peng Wei,Hu Xiaofeng,Zhao Feng,Su Jinshu
Reference17 articles.
1. T. M. Chan. All-pairs shortest paths with real weights in O(n3/log n)time. in: Proc. 9thWorkshop Algorithms Data Structures, in: Lecture Notes in Computer Science, vol.3608, Springer, Berlin, 2005, pp.318-324.
2. T.M. Chan. All-Pairs ShortestPathsfor Unweighted Undirected Graphsin o(mn)Time. SODA’06, January 22-26, Miami, FL, 2006 .
3. S. Baswana,V. Goyal,S. Sen. All-Pairs nearly 2-approximate shortest pathsin O(n2polylogn)time. Theoretical Computer Science, vol.410, no.1, pp.84-3, 2009 .
4. J.-T. Tang,T. Wang, andJ. Wang. ShortestPath Approximate Algorithm for Complex Network Analysis. Journalof Software,vol.22, no.10, pp.2279 -2290, 2011 .
5. E.W. Dijkstra. ANote onTwo Problemsin Connexion with Graphs. Numerische Mathematik,vol.1, pp.269-271, 1959 .
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献