Constant-time connectivity tests

10/09/2020
by   Philipp Klaus Krause, et al.
0

We present implementations of constant-time algorithms for connectivity tests and related problems. Some are implementations of slightly improved variants of previously known algorithms; for other problems we present new algorithms that have substantially better runtime than previously known algorithms (estimates of the distance to and tolerant testers for connectivity, 2-edge-connectivity, 3-edge-connectivity, eulerianity).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2019

Small Cuts and Connectivity Certificates: A Fault Tolerant Approach

We revisit classical connectivity problems in the CONGEST model of distr...
research
02/12/2023

Fully Dynamic Exact Edge Connectivity in Sublinear Time

Given a simple n-vertex, m-edge graph G undergoing edge insertions and d...
research
05/10/2022

Edge Connectivity Augmentation in Near-Linear Time

We give an Õ(m)-time algorithm for the edge connectivity augmentation pr...
research
09/08/2019

Multi-group connectivity structures and their implications

We investigate the implications of different forms of multi-group connec...
research
02/13/2022

Locating Charging Stations: Connected, Capacitated and Prize- Collecting

In this paper, we study locating charging station problem as facility lo...
research
04/23/2020

Diophantine problems related to the Omega constant

Some diophantine problems are stated for the Omega constant and, more ge...
research
08/24/2022

A Slightly Improved Bound for the KLS Constant

We refine the recent breakthrough technique of Klartag and Lehec to obta...

Please sign up or login with your details

Forgot password? Click here to reset