Near-optimal fully-dynamic graph connectivity

@inproceedings{Thorup2000NearoptimalFG,
  title={Near-optimal fully-dynamic graph connectivity},
  author={Mikkel Thorup},
  booktitle={STOC '00},
  year={2000}
}
  • M. Thorup
  • Published in STOC '00 1 May 2000
  • Mathematics, Computer Science
In this paper we present near-optimal bounds for fullydynamic graph connectivity which is the most basic nontrivial fully-dynamic graph problem. Connectivity queries are supported in O(log n/log log log n) time while the updates are supported in O(log n(log log n) 3) expected amortized time. The previous best update time was O((log n)2). Our new bound is only doubly-logarithmic factors from a general cell probe lower bound of f2(log n~ log log n). Our algorithm runs on a pointer machine, and… 
Dynamic Bridge-Finding in Õ(log2 n) Amortized Time
TLDR
A deterministic fully-dynamic data structure for maintaining information about the bridges in a graph that supports updates in O((log n)2) amortized time, and yields an improved running time for deciding whether a unique perfect matching exists in a static graph.
Faster deterministic fully-dynamic graph connectivity
We give new deterministic bounds for fully-dynamic graph connectivity. Our data structure supports updates (edge insertions/deletions) in O(log2 n/log log n) amortized time and connectivity queries
Faster Deterministic Fully-Dynamic Graph Connectivity
TLDR
The model of computation is the same as that of Thorup, i.e., a pointer machine with standard $AC^0$ instructions, and gives new deterministic bounds for fully-dynamic graph connectivity.
Faster Deterministic Fully-Dynamic Graph Connectivity
TLDR
A model of computation is the same as that of Thorup, i.e., a pointer machine with standard AC instructions that improves the deterministic data structures of Holm, de Lichtenberg, and Thorup.
Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time
TLDR
A new randomized dynamic connectivity structure with amortized expected update time and query time is presented, which comes within an O(log n/\log\log n)^2 factor of a lower bound due to Patrascu and Demaine.
Dynamic graph connectivity in polylogarithmic worst case time
TLDR
The technique can be used to simplify and significantly speed up the preprocessing time for the emergency planning problem while matching previous bounds for an update, and to approximate the sizes of cutsets of dynamic graphs in time O(min{|S|, |V\S|}) for an oblivious adversary.
Optimal Decremental Connectivity in Non-Sparse Graphs
TLDR
A dynamic algorithm for maintaining the connected and 2-edge-connected components in an undirected graph subject to edge deletions that is Monte-Carlo randomized and can answer queries to whether any two given vertices currently belong to the same (2-edge-)connected component in constant time.
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
TLDR
A new perfect matching algorithm for biconnected cubic graphs and a significant modification of the new algorithm which makes application of a decremental dynamic graph connectivity data structure possible, instead of one supporting the fully dynamicgraph connectivity.
Lower bounds for dynamic connectivity
TLDR
This work proves an Ω(lg Erik n / lg lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries, and forms a general framework for proving cell- Probe lower bounds on dynamic data structures.
An Improved Randomized Data Structure for Dynamic Graph Connectivity
TLDR
This work presents a randomized algorithm for dynamic graph connectivity that uses copies of a data structure to boost a success probability from 1/2 to 1-n^{-c} and shows that it can still obtain the same correctness guarantee with high probability by arguing via a new invariant, without repetition.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 12 REFERENCES
Decremental dynamic connectivity
  • M. Thorup
  • Computer Science, Mathematics
    SODA '97
  • 1997
TLDR
It is shown that starting from a graph with m edges and n nodes, it can maintain a spanning forest during m deletions in O ( m  log) expected time, which is based on a general randomized reduction for edge connectivity problems of many deletions-only queries to a few deletions and insertions queries.
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
TLDR
An amortized lower bound of $\Omega$ (log n / {k (log log n} + log b)) per edge insertion, deletion, or query operation in the cell probe model is shown, which are the first lower bounds for fully dynamic connectivity problems.
Randomized dynamic graph algorithms with polylogarithmic time per operation
TLDR
This paper presents the first fully dynamic algorithms that maintain connectivity, bipartiteness, and approximate minimum spanning trees in polylogarithmic time per edge insertion or deletion using a new dynamic technique that combines a novel graph decomposition with randomization.
Sampling to provide or to bound: With applications to fully dynamic graph algorithms
TLDR
This work gives an optimal algorithm for providing an upper bound on the size of R that holds with high probability and improves the time per operation for various dyamic graph algorithms by a factor of O(log n).
Sampling to provide or to bound: with applications to fully dynamic graph algorithms
In dynamic graph algorithms the following provide-or-bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random elements from S testing for membership
A data structure for dynamic trees
Abstract A data structure is proposed to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Deterministic fully dynamic graph algorithms are presented for connectivity, minimum spanning tree, 2-edge connectivity, and biconnectivity. Assuming that we start with no edges in a graph with n
Data structures for on-line updating of minimum spanning trees
Data structures are presented for the problem of maintaining a minimum spanning tree on-line under the operation of updating the cost of some edge in the graph. For the case of a general graph,
Sparsification—a technique for speeding up dynamic graph algorithms
TLDR
All algorithms are based on a new technique that transforms an algorithm for sparse graphs into one that will work on any graph, which is calledsparsification, and results speed up the insertion times to match the bounds of known partially dynamic algorithms.
Efficiency of a Good But Not Linear Set Union Algorithm
  • R. Tarjan
  • Mathematics, Computer Science
    JACM
  • 1975
TLDR
It is shown that, if t(m, n) is seen as the maximum time reqmred by a sequence of m > n FINDs and n -- 1 intermixed UNIONs, then kima(m), n is shown to be related to a functional inverse of Ackermann's functmn and as very slow-growing.
...
1
2
...