Dynamic Bridge-Finding in Õ(log2 n) Amortized Time

  title={Dynamic Bridge-Finding in {\~O}(log2 n) Amortized Time},
  author={Jacob Holm and Eva Rotenberg and Mikkel Thorup},
  booktitle={ACM-SIAM Symposium on Discrete Algorithms},
We present a deterministic fully-dynamic data structure for maintaining information about the bridges in a graph. We support updates in O((log n)2) amortized time, and can find a bridge in the component of any given vertex, or a bridge separating any two given vertices, in O(log n/ log log n) worst case time. Our bounds match the current best for bounds for deterministic fully-dynamic connectivity up to log log n factors. The previous best dynamic bridge finding was an O((log n)3) amortized… 

Tables from this paper

Optimal Decremental Connectivity in Non-Sparse Graphs

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.

Worst-case Deterministic Fully-Dynamic Planar 2-vertex Connectivity

It is shown that the best for fully-dynamic biconnectivity was an amortised O (log 3 n ) for general graphs, and algorithms with worst-case polylogarithmic update times were known only in the partially dynamic (insertion-only or deletion-only) setting.

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles ∗

We present a data structure that in a dynamic graph of treedepth at most d , which is modified over time by edge insertions and deletions, maintains an optimum-height elimination forest. The data

Fully Dynamic c-Edge Connectivity in Subpolynomial Time

We present a deterministic fully dynamic algorithm for $c$-edge connectivity problem with $n^{o(1)}$ worst case update and query time for any positive integer $c = (\log n)^{o(1)}$ for a graph with

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity

This work gives offline algorithms for processing a sequence of 2- and 3-edge and vertex connectivity queries in a fully-dynamic undirected graph using a divide and conquer scheme that transforms a graph into smaller equivalents that preserve connectivity information.

Improved Dynamic Colouring of Sparse Graphs

The number of colours exponentially is improved exponentially compared to the state-of-the art for implicit colouring, namely from O (2 α ) colours, and the theoretical lower bound of Ω( α ) is approached for this arboricity-parameterised approach.

Good r-divisions imply optimal amortized decremental biconnectivity

A data structure is presented that, given a graph G of n vertices and m edges, and a suitable pair of nested r -divisions of G, preprocesses G in O ( m + n ) time and handles any series of edge-deletions in M total time while answering queries to pairwise biconnectivity in worst-case O (1) time.

Good r-divisions Imply Optimal Amortised Decremental Biconnectivity

A data structure that preprocesses a graph G in time and handles any series of edge-deletions in total time and gives optimal amortized decremental biconnectivity, 2-edge connectivity, and connectivity for large classes of graphs, including planar graphs and other minor free graphs.

Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix

A bridge between linear logic and mainstream graph theory is established and the coNP-hardness of Pagani's visible acyclicity criterion for MELL proof nets is proved, and Lamarche's essential nets to R&B-graphs are connected.

Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix

This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003). We show that the problem of correctness for MLL+Mix proof nets is



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.

Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time

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.

Faster Deterministic Fully-Dynamic Graph Connectivity

A model of computation is the same as that of Thorup, i.e., a pointer machine with standard AC0 instructions that improves the deterministic data structures of Holm, de Lichtenberg, and Thorup.

Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time

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.

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 graph connectivity in polylogarithmic worst case time

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.

Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation

This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmic time per operation, a Las-Vegas type randomized algorithm.

Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

  • G. Frederickson
  • Computer Science
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
Ambivalent data structures are presented for several problems on undirected graphs and used in finding the k smallest spanning trees of a weighted undirecting graph in O(m log beta (m,n)+min(k/sup 3/2/, km/sup 1/2/)) time, where m and n are understood to be the current number of edges and vertices, respectively.

Maintaining Minimum Spanning Trees in Dynamic Graphs

This work presents the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per update, with O(1) worst case time per query.

Improved Sparsification

An improved sparsification technique is described that avoids the logarithmic overhead and keeps track of the following properties: minimum spanning forest, best swap, connectivity, 2-edge-connectivity, and bipartiteness.