Faster Fully-Dynamic Minimum Spanning Forest

We give a new data structure for the fully-dynamic minimum spanning forest problem in simple graphs. Edge updates are supported in O(log4n/loglogn) expected amortized time per operation, improving the O(log4n) amortized bound of Holm et al. (STOC ’98, JACM ’01). We also provide a deterministic data structure with amortized update time O(log4n logloglogn/loglogn). We assume the Word-RAM model with standard instructions.

[1]  Mikkel Thorup,et al.  Sampling to provide or to bound: with applications to fully dynamic graph algorithms , 1997 .

[2]  Christian Wulff-Nilsen.  Faster deterministic fully-dynamic graph connectivity , 2013, SODA 2013.

[3]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[4]  Mihai Patrascu,et al.  Lower bounds for dynamic connectivity , 2004, Symposium on the Theory of Computing.

[5]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[6]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[7]  Rajeev Raman,et al.  Fast Algorithms for Shortest Paths and Sorting , 1996 .

[8]  Mikkel Thorup,et al.  Maintaining information in fully dynamic trees with top trees , 2003, TALG.

[9]  HolmJacob,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001 .

[10]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[11]  Mikkel Thorup,et al.  Near-optimal fully-dynamic graph connectivity , 2000, STOC '00.

[12]  Christian Wulff-Nilsen,et al.  Faster Deterministic Fully-Dynamic Graph Connectivity , 2012, Encyclopedia of Algorithms.

[13]  R HenzingerMonika,et al.  Randomized fully dynamic graph algorithms with polylogarithmic time per operation , 1999 .

[14]  Yijie Han,et al.  Deterministic sorting in O(nloglogn) time and linear space , 2004, J. Algorithms.

[15]  Mikkel Thorup,et al.  Sampling to provide or to bound: With applications to fully dynamic graph algorithms , 1997, Random Struct. Algorithms.

[16]  Yijie Han,et al.  Deterministic sorting inO(nlog logn) time and linear space , 2002, STOC 2002.

[17]  Mikkel Thorup.  Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations , 1997, SODA '97.

[18]  Valerie King,et al.  Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation , 1997 .