暂无分享,去创建一个
[1] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2003, STOC '03.
[2] Monika Henzinger,et al. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs , 2014, STOC.
[3] Ittai Abraham,et al. Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch , 2013, ArXiv.
[4] Ramesh Hariharan,et al. Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths , 2002, STOC '02.
[5] Christian Wulff-Nilsen,et al. Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.
[6] Christian Wulff-Nilsen,et al. Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary , 2020, SODA.
[7] Shiri Chechik,et al. Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs , 2017, SODA.
[8] Shiri Chechik,et al. Near-Optimal Approximate Decremental All Pairs Shortest Paths , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[9] Adam Karczmarz,et al. Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs , 2019, ESA.
[10] Ittai Abraham,et al. Fully dynamic all-pairs shortest paths with worst-case update-time revisited , 2016, SODA.
[11] Monika Henzinger,et al. Fully dynamic biconnectivity and transitive closure , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[12] Aaron Bernstein,et al. Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs , 2017, ICALP.
[13] Shimon Even,et al. An On-Line Edge-Deletion Problem , 1981, JACM.
[14] Giuseppe F. Italiano,et al. Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[15] Uri Zwick,et al. Dynamic approximate all-pairs shortest paths in undirected graphs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[16] Aaron Bernstein. Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs , 2016, SIAM J. Comput..
[17] Amir Abboud,et al. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[18] Thatchaphol Saranurak,et al. Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary , 2020, ICALP.
[19] Monika Henzinger,et al. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[20] Thatchaphol Saranurak,et al. Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[21] Christian Wulff-Nilsen,et al. Decremental strongly-connected components and single-source reachability in near-linear time , 2019, STOC.
[22] Shiri Chechik,et al. Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.
[23] Monika Henzinger,et al. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.
[24] Monika Henzinger,et al. A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths , 2014, SODA.
[25] Mikkel Thorup,et al. Worst-case update times for fully-dynamic all-pairs shortest paths , 2005, STOC '05.
[26] Mikkel Thorup,et al. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles , 2004, SWAT.
[27] 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.
[28] Liam Roditty,et al. Improved dynamic algorithms for maintaining approximate shortest paths under deletions , 2011, SODA '11.
[29] Aaron Bernstein,et al. Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[30] 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).
[31] Virginia Vassilevska Williams,et al. New algorithms and hardness for incremental single-source shortest paths in directed graphs , 2020, STOC.
[32] Christian Wulff-Nilsen,et al. Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds , 2020, SODA.
[33] Thatchaphol Saranurak,et al. Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition , 2020, SODA.
[34] Julia Chuzhoy,et al. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems , 2019, STOC.
[35] Christian Wulff-Nilsen,et al. Near-Optimal Decremental SSSP in Dense Weighted Digraphs , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[36] Christian Wulff-Nilsen,et al. Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler , 2020, SODA.
[37] Adam Karczmarz,et al. Simple Label-Correcting Algorithms for Partially Dynamic Approximate Shortest Paths in Directed Graphs , 2020, SOSA@SODA.