Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. A separator theorem for nonplanar graphs;Alon;J. Amer. Math. Soc.,1990
2. On a routing problem;Bellman;Quart. Appl. Math.,1958
3. E. Cohen, Efficient parallel shortest-paths in digraphs with a separator decomposition, in: Proc. 5th Annual Symposium on Parallel Algorithms and Architectures, SPAA, 1993, pp. 57–67.
4. A note on two problems in connection with graphs;Dijkstra;Numer. Math.,1959
5. Planar graphs, negative weight edges, shortest paths, and near linear time;Fakcharoenphol;J. Comput. Syst. Sci.,2006
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献