Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary
暂无分享,去创建一个
[1] Shiri Chechik,et al. Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs , 2017, SODA.
[2] Monika Henzinger,et al. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[3] Monika Henzinger,et al. A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths , 2014, SODA.
[4] Monika Henzinger,et al. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs , 2014, STOC.
[5] Monika Henzinger,et al. Fully dynamic biconnectivity and transitive closure , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[6] Valerie King,et al. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[7] Giuseppe F. Italiano,et al. Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[8] Shimon Even,et al. An On-Line Edge-Deletion Problem , 1981, JACM.
[9] Uri Zwick,et al. On Dynamic Shortest Paths Problems , 2004, Algorithmica.
[10] Shiri Chechik,et al. Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.
[11] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[12] Liam Roditty,et al. Improved dynamic algorithms for maintaining approximate shortest paths under deletions , 2011, SODA '11.