Edge Connectivity Augmentation in Near-Linear Time

05/10/2022
by   Ruoxu Cen, et al.
0

We give an Õ(m)-time algorithm for the edge connectivity augmentation problem and the closely related edge splitting-off problem. This is optimal up to lower order terms and closes the long line of work on these problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2021

Computing the 4-Edge-Connected Components of a Graph in Linear Time

We present the first linear-time algorithm that computes the 4-edge-conn...
research
11/10/2022

Steiner Connectivity Augmentation and Splitting-off in Poly-logarithmic Maximum Flows

We give an almost-linear time algorithm for the Steiner connectivity aug...
research
04/18/2020

The (2,k)-connectivity augmentation problem: Algorithmic aspects

Durand de Gevigney and Szigeti <cit.> have recently given a min-max theo...
research
10/09/2020

Constant-time connectivity tests

We present implementations of constant-time algorithms for connectivity ...
research
11/03/2021

Augmenting Edge Connectivity via Isolating Cuts

We give an algorithm for augmenting the edge connectivity of an undirect...
research
09/14/2022

Parameterized algorithms for node connectivity augmentation problems

A graph G is k-out-connected from its node s if it contains k internally...
research
09/16/2022

A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation

Connectivity augmentation problems are among the most elementary questio...

Please sign up or login with your details

Forgot password? Click here to reset