Author:
Baswana Surender,Choudhary Keerti,Roditty Liam
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Baswana, S., Khanna, N.: Approximate shortest paths avoiding a failed vertex: Near optimal data structures for undirected unweighted graphs. Algorithmica 66(1), 18–50 (2013)
2. Bentley, J.L.: Solutions to Klee’s rectangle problems, Dept. of Comp. Sci., Carnegie-Mellon University, Pittsburgh, PA (1977) (unpublished manuscript)
3. Bernstein, A., Karger, D.: A nearly optimal oracle for avoiding failed vertices and edges. In: STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 101–110. ACM, New York (2009)
4. Buchsbaum, A.L., Georgiadis, L., Kaplan, H., Rogers, A., Tarjan, R.E., Westbrook, J.: Linear-time algorithms for dominators and other path-evaluation problems. SIAM J. Comput. 38(4), 1533–1573 (2008)
5. Chechik, S.: Fault-tolerant compact routing schemes for general graphs. Inf. Comput. 222, 36–44 (2013)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献