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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.