Author:
Henzinger Monika R,Klein Philip,Rao Satish,Subramanian Sairam
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference28 articles.
1. Faster algorithms for the shortest path problem;Ahuja;J. Assoc. Comput. Mach.,1990
2. A separator theorem for nonplanar graphs;Alon;J. Amer. Math. Soc.,1990
3. E. Cohen, Efficient parallel shortest-paths in digraphs with a separator decomposition, Proceedings, 5th Annual Symposium on Parallel Algorithms and Architectures, 1993
4. Data structures for on-line updating of minimum spanning trees, with applications;Frederickson;SIAM J. Comput.,1985
5. Fast algorithms for shortest paths in planar graphs, with applications;Frederickson;SIAM J. Comput.,1987
Cited by
246 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献