Determining 4-edge-connected components in linear time

05/04/2021
by   Wojciech Nadara, et al.
0

In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph, and then we use the output of this algorithm in order to determine the 4-edge-connected components of the graph.

READ FULL TEXT
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
03/28/2022

GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams

Finding the connected components of a graph is a fundamental problem wit...
research
10/14/2019

FastSV: A Distributed-Memory Connected Component Algorithm with Fast Convergence

This paper presents a new distributed-memory algorithm called FastSV for...
research
02/11/2020

A simple certifying algorithm for 3-edge-connectivity

A linear-time certifying algorithm for 3-edge-connectivity is presented....
research
12/10/2020

Building Graphs at a Large Scale: Union Find Shuffle

Large scale graph processing using distributed computing frameworks is b...
research
07/20/2022

Fault-Tolerant Distributed Directories

A distributed directory is an overlay data structure on a graph G that h...
research
06/01/1998

Model-Based Diagnosis using Structured System Descriptions

This paper presents a comprehensive approach for model-based diagnosis w...

Please sign up or login with your details

Forgot password? Click here to reset