Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time
暂无分享,去创建一个
[1] Zeyuan Allen Zhu,et al. Flow-Based Algorithms for Local Graph Clustering , 2013, SODA.
[2] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[3] 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.
[4] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.
[5] Mikkel Thorup,et al. Sampling to provide or to bound: With applications to fully dynamic graph algorithms , 1997, Random Struct. Algorithms.
[6] Richard Peng,et al. Approximate Undirected Maximum Flows in O(mpolylog(n)) Time , 2014, SODA.
[7] HolmJacob,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001 .
[8] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.
[9] Erik D. Demaine,et al. Logarithmic Lower Bounds in the Cell-Probe Model , 2005, SIAM J. Comput..
[10] 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.
[11] Haim Kaplan. Persistent Data Structures , 2004, Handbook of Data Structures and Applications.
[12] Christian Wulff-Nilsen. Faster Deterministic Fully-Dynamic Graph Connectivity , 2016, Encyclopedia of Algorithms.
[13] Robert E. Tarjan,et al. Making data structures persistent , 1986, STOC '86.
[14] Paul G. Spirakis,et al. Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time , 1995, ICALP.
[15] Monika Henzinger,et al. Maintaining Minimum Spanning Forests in Dynamic Graphs , 2001, SIAM J. Comput..
[16] Shiri Chechik,et al. Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs , 2017, SODA.
[17] Shiri Chechik,et al. Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.
[18] Mikkel Thorup,et al. Worst-case update times for fully-dynamic all-pairs shortest paths , 2005, STOC '05.
[19] Mikkel Thorup,et al. Maintaining information in fully dynamic trees with top trees , 2003, TALG.
[20] Mikkel Thorup,et al. Near-optimal fully-dynamic graph connectivity , 2000, STOC '00.
[21] David P. Woodruff,et al. On Sketching Quadratic Forms , 2015, ITCS.
[22] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[23] Bruce M. Kapron,et al. Dynamic graph connectivity with improved worst case update time and sublinear space , 2015, ArXiv.
[24] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[25] Uri Zwick,et al. Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs , 2004, FOCS.
[26] Monika Henzinger,et al. Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time , 2017, SODA.
[27] Piotr Indyk,et al. Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[28] David Eppstein,et al. Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[29] Satish Rao,et al. Graph partitioning using single commodity flows , 2009, JACM.
[30] Christian Wulff-Nilsen,et al. Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.
[31] Mikkel Thorup,et al. Faster Worst Case Deterministic Dynamic Connectivity , 2016, ESA.
[32] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.
[33] Tsvi Kopelowitz,et al. Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time , 2016, SODA.
[34] Jonah Sherman,et al. Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[35] Aleksander Madry,et al. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.
[36] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..
[37] Bruce M. Kapron,et al. Dynamic graph connectivity in polylogarithmic worst case time , 2013, SODA.
[38] Mikkel Thorup,et al. Fully-dynamic min-cut , 2001, STOC '01.
[39] Richard Peng,et al. On Fully Dynamic Graph Sparsifiers , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[40] Mikkel Thorup,et al. Planning for Fast Connectivity Updates , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).