Dynamic graph connectivity in polylogarithmic worst case time

  title={Dynamic graph connectivity in polylogarithmic worst case time},
  author={Bruce M. Kapron and Valerie King and Ben Mountjoy},
The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence of edge insertions and deletions, answer queries of the form q(a, b): "Is there a path between nodes a and b?" While data structures for this problem with polylogarithmic amortized time per operation have been known since the mid-1990's, these data structures have Θ(n) worst case time. In fact, no previously known solution has worst case time per operation which is o… 

Figures from this paper

Dynamic graph connectivity with improved worst case update time and sublinear space
This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space, and shows that 2-edge connectivity can be maintained using O(n log^2 n) words with an amortized update time of O(log^6 n).
Dynamic Bridge-Finding in Õ(log2 n) Amortized Time
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.
Fully Dynamic Maximal Matching in O (log n) Update Time
This is the first polylog update time for maximal matching that implies an exponential improvement from the previous results and can maintain a factor two approximate maximum matching in $O(\log n )$ expected amortized time per update as a direct corollary of the maximal matching scheme.
Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs
To the best of the knowledge, this is the first fully dynamic strong-connectivity algorithm achieving both sublinear update time and polylogarithmic query time for an important class of digraphs.
Dynamic Graph Algorithms for Connectivity Problems
This thesis presents several new algorithms for dynamic graph problems, including an algorithm for decremental connectivity in planar graphs, the maintenance of connected components in a dynamic graph, and the Steiner tree problem over a dynamic set of terminals.
  • G. Lagogiannis
  • Computer Science, Mathematics
  • 2021
This paper shows that instead of solving the dynamic connectivity problem on a general graph G, it suffices to solve it on a graph the authors name aligned double-forest that has only 2n-1 edges where n is the number of vertices, and presents an algorithm that achieves all the operations in logarithmic worst-case time.
Fully Dynamic Spanners with Worst-Case Update Time
This paper gives fully dynamic algorithms for maintaining a spanner H of a graph G undergoing edge insertions and deletions with worst-case guarantees on the running time after each update, and are the first dynamic spanner algorithms with sublinear worst- case update time guarantees.
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
This paper develops an efficient (1 + ε) -approximation algorithm for this query using fast matrix multiplication and obtains the first dynamic APSP algorithm with subquadratic update time and sublinear query time.
Fully-dynamic minimum spanning forest with improved worst-case update time
A Las Vegas data structure which maintains a minimum spanning forest in an n-vertex edge-weighted undirected dynamic graph undergoing updates consisting of any mixture of edge insertions and deletions, achieving an improvement over the O(√n) deterministic worst-case update time of Eppstein et al.
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
The fully dynamic algorithm provides, in a seamless manner, the first deterministic algorithm with O(1) query time and o(m) worst case update time for the dynamic subgraph connectivity, biconnectivity, and 2-edge connectivity.


Near-optimal fully-dynamic graph connectivity
Near-optimal bounds for fullydynamic graph connectivity which is the most basic nontrivial fully-d dynamic graph problem are presented and some comparatively trivial observations are made improving some deterministic bounds.
Sparsification-a technique for speeding up dynamic graph algorithms
The authors provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties: minimum spanning forests, best swap, graph connectivity, and
A data structure for dynamic trees
An O(mn log n)-time algorithm is obtained to find a maximum flow in a network of n vertices and m edges, beating by a factor of log n the fastest algorithm previously known for sparse graphs.
Sampling to provide or to bound: With applications to fully dynamic graph algorithms
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 dynamic graph algorithms by a factor of O(log n).
Analyzing graph structure via linear measurements
The study of graph sketching is initiated, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph are studied, including the first dynamic graph semi-streaming algorithms for connectivity, spanning trees, sparsification, and matching problems.
Planning for Fast Connectivity Updates
  • M. Patrascu, M. Thorup
  • Computer Science
    48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
  • 2007
A linear-space representation of graphs is described which enables us to determine how a batch of edge updates can impact the graph.
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
Dynamic trees in practice
It is observed that a simple, linear-time implementation of dynamic trees is remarkably fast for graphs of small diameter, and that worst-case and randomized data structures are best when queries are very frequent.
Let A be a set of positive integers. Let us denote by p(A, n) the number of partitions of n with parts in A. While the study of the parity of the classical partition function p(N, n) (where N is the
A simpler minimum spanning tree verification algorithm
  • V. King
  • Computer Science
  • 2006
An algorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make is presented and a linear-time procedure for its implementation in the unit cost RAM model is given.