Good r-divisions Imply Optimal Amortised Decremental Biconnectivity

08/07/2018
by   Jacob Holm, et al.
0

We present a data structure that given a graph G of n vertices and m edges, and a suitable pair of r-divisions of G, preprocesses G in O(m+n) time and handles any series of edge-deletions in O(m) total time while answering queries to pairwise biconnectivity in O(1) time. In case the vertices are not biconnected, the data structure can return a cut-vertex separating them in O(1) time. As an immediate consequence, this gives optimal amortised decremental biconnectivity, 2-edge connectivity, and connectivity for large classes of graphs, such as planar graphs, minor free graphs, and more.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2018

Decremental SPQR-trees for Planar Graphs

We present a decremental data structure for maintaining the SPQR-tree of...
research
02/12/2021

The Structure of Minimum Vertex Cuts

In this paper we continue a long line of work on representing the cut st...
research
07/24/2019

Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank

We present a pointer-based data structure for constant time traversal of...
research
07/19/2018

When Do Gomory-Hu Subtrees Exist?

Gomory-Hu (GH) Trees are a classical sparsification technique for graph ...
research
11/05/2021

Algorithms and data structures for first-order logic with connectivity under vertex failures

We introduce a new data structure for answering connectivity queries in ...
research
01/25/2023

Succinct Planar Encoding with Minor Operations

Let G be an unlabeled planar and simple n-vertex graph. We present a suc...
research
01/02/2022

Optimal Vertex Connectivity Oracles

A k-vertex connectivity oracle for undirected G is a data structure that...

Please sign up or login with your details

Forgot password? Click here to reset