Incremental Strong Connectivity and 2-Connectivity in Directed Graphs

02/27/2018
by   Loukas Georgiadis, et al.
0

In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of those cuts. We give a conditional lower bound that provides evidence that our algorithms may be tight up to sub-polynomial factors. As an additional result, with our approach we can also maintain dynamically the 2-vertex-connected components of a digraph during any sequence of edge insertions in a total of O(mn) time. This matches the bounds for the incremental maintenance of the 2-edge-connected components of a digraph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2021

Faster Algorithms for Rooted Connectivity in Directed Graphs

We consider the fundamental problems of determining the rooted and globa...
research
02/27/2013

Incremental Dynamic Construction of Layered Polytree Networks

Certain classes of problems, including perceptual data understanding, ro...
research
11/17/2021

Optimal Decremental Connectivity in Non-Sparse Graphs

We present a dynamic algorithm for maintaining the connected and 2-edge-...
research
04/18/2023

Connectivity in the presence of an opponent

The paper introduces two player connectivity games played on finite bipa...
research
08/10/2020

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms

Connected components is a fundamental kernel in graph applications due t...
research
12/04/2019

Correspondent Banking Networks: Theory and Experiment

We employ the mathematical programming approach in conjunction with the ...
research
10/12/2018

Parallelism in Randomized Incremental Algorithms

In this paper we show that many sequential randomized incremental algori...

Please sign up or login with your details

Forgot password? Click here to reset