Fully Dynamic Spanners with Worst-Case Update Time
暂无分享,去创建一个
[1] Surender Baswana,et al. Streaming algorithm for graph spanners - single pass and constant processing time per edge , 2008, Inf. Process. Lett..
[2] Soumojit Sarkar,et al. Fully dynamic randomized algorithms for graph spanners , 2012, TALG.
[3] Michael Elkin,et al. A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners , 2006, PODC '07.
[4] Lenore Cowen,et al. Compact roundtrip routing in directed networks , 2004, J. Algorithms.
[5] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..
[6] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[7] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.
[8] Mihai Patrascu,et al. Distance Oracles beyond the Thorup-Zwick Bound , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[9] Telikepalli Kavitha,et al. Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs , 2010, SIAM J. Comput..
[10] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[11] Robert Krauthgamer,et al. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds , 2013, ICALP.
[12] Lenore Cowen,et al. Compact routing with minimum stretch , 1999, SODA '99.
[13] Mihalis Yannakakis,et al. High-Probability Parallel Transitive-Closure Algorithms , 1991, SIAM J. Comput..
[14] Uri Zwick,et al. Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs , 2004, FOCS.
[15] Sandeep Sen,et al. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.
[16] David Peleg,et al. Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach , 2016, SODA.
[17] Shiri Chechik,et al. Approximate Distance Oracle with Constant Query Time , 2013, ArXiv.
[18] Allan Borodin,et al. On the power of randomization in on-line algorithms , 2005, Algorithmica.
[19] Tsvi Kopelowitz,et al. Online Dictionary Matching with One Gap , 2015, ArXiv.
[20] Liam Roditty,et al. Improved dynamic algorithms for maintaining approximate shortest paths under deletions , 2011, SODA '11.
[21] Mihalis Yannakakis,et al. High-probability parallel transitive closure algorithms , 1990, SPAA '90.
[22] Jose Augusto Ramos Soares,et al. Graph Spanners: a Survey , 1992 .
[23] Mikkel Thorup,et al. Compact routing schemes , 2001, SPAA '01.
[24] Ittai Abraham,et al. Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier , 2014, APPROX-RANDOM.
[25] Mikkel Thorup,et al. Roundtrip spanners and roundtrip routing in directed graphs , 2002, SODA '02.
[26] Arthur M. Farley,et al. Spanners and message distribution in networks , 2004, Discret. Appl. Math..
[27] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[28] Giuseppe F. Italiano,et al. A new approach to dynamic all pairs shortest paths , 2003, STOC '03.
[29] Rephael Wenger,et al. Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.
[30] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.
[31] Piotr Sankowski,et al. Dynamic Transitive Closure via Dynamic Matrix Inverse , 2004 .
[32] Mikkel Thorup,et al. Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.
[33] Joan Feigenbaum,et al. Graph Distances in the Data-Stream Model , 2008, SIAM J. Comput..
[34] Uri Zwick,et al. All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..
[35] Mikkel Thorup,et al. Worst-case update times for fully-dynamic all-pairs shortest paths , 2005, STOC '05.
[36] Leonid Barenboim,et al. Distributed Graph Coloring: Fundamentals and Recent Developments , 2013, Distributed Graph Coloring: Fundamentals and Recent Developments.
[37] Michael Elkin,et al. Computing almost shortest paths , 2001, TALG.
[38] Ittai Abraham,et al. Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch , 2013, ArXiv.
[39] Michael Elkin,et al. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.
[40] Shiri Chechik,et al. Approximate Distance Oracles with Improved Bounds , 2015, STOC.
[41] Giuseppe F. Italiano,et al. Small Stretch Spanners on Dynamic Graphs , 2005, J. Graph Algorithms Appl..
[42] David Eppstein,et al. Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.
[43] Shay Solomon,et al. Simple Deterministic Algorithms for Fully Dynamic Maximal Matching , 2016, TALG.
[44] Bruce M. Kapron,et al. Dynamic graph connectivity in polylogarithmic worst case time , 2013, SODA.
[45] Richard Peng,et al. On Fully Dynamic Graph Sparsifiers , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[46] Monika Henzinger,et al. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2018, J. ACM.