DeepAI
Log In Sign Up

A Simple Deterministic Algorithm for Edge Connectivity

08/19/2020
by   Thatchaphol Saranurak, et al.
0

We show a deterministic algorithm for computing edge connectivity of a simple graph with m edges in m^1+o(1) time. Although the fastest deterministic algorithm by Henzinger, Rao, and Wang [SODA'17] has a faster running time of O(mlog^2mloglog m), we believe that our algorithm is conceptually simpler. The key tool for this simplication is the expander decomposition. We exploit it in a very straightforward way compared to how it has been previously used in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/27/2021

Quantum Algorithm for the Longest Trail Problem

We present the quantum algorithm for the Longest Trail Problem. The prob...
11/03/2021

Augmenting Edge Connectivity via Isolating Cuts

We give an algorithm for augmenting the edge connectivity of an undirect...
03/31/2021

Vertex Connectivity in Poly-logarithmic Max-flows

The vertex connectivity of an m-edge n-vertex undirected graph is the sm...
08/24/2022

Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time

The f-fault-toleratant connectivity labeling (f-FTC labeling) is a schem...
10/23/2019

Vertex Sparsifiers for c-Edge Connectivity

We show the existence of O(f(c)k) sized vertex sparsifiers that preserve...
05/12/2020

Control of connectivity and rigidity in prismatic assemblies

How can we manipulate the topological connectivity of a three-dimensiona...
10/09/2020

Constant-time connectivity tests

We present implementations of constant-time algorithms for connectivity ...