AI Chat AI Image Generator AI Video Text to Speech

Improved Linear-Time Algorithm for Computing the 4-Edge-Connected Components of a Graph

08/19/2021

∙

by Loukas Georgiadis, et al.

∙

∙

We present an improved algorithm for computing the 4-edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and it is simple to describe and to implement in the pointer machine model of computation.

Loukas Georgiadis
7 publications
Giuseppe F. Italiano
13 publications
Evangelos Kosinas
6 publications

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...

0 Loukas Georgiadis, et al. ∙

research

∙ 06/01/1998

Model-Based Diagnosis using Structured System Descriptions

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

0 A. Darwiche, et al. ∙

research

∙ 08/30/2023

Decomposing Triangulations into 4-Connected Components

A connected graph is 4-connected if it contains at least five vertices a...

0 Sabine Cornelsen, et al. ∙

research

∙ 08/04/2020

Automorphism groups of maps in linear time

By a map we mean a 2-cell decomposition of a closed compact surface, i.e...

0 Ken-ichi Kawarabayashi, et al. ∙

research

∙ 06/25/2023

On finding 2-cuts and 3-edge-connected components in parallel

Given a connected undirected multigraph G (a graph that may contain para...

0 Yung H. Tsin, et al. ∙

research

∙ 02/11/2020

A simple certifying algorithm for 3-edge-connectivity

A linear-time certifying algorithm for 3-edge-connectivity is presented....

0 Yung H. Tsin, et al. ∙

research

∙ 02/15/2017

Linear Time Computation of Moments in Sum-Product Networks

Bayesian online algorithms for Sum-Product Networks (SPNs) need to updat...

0 Han Zhao, et al. ∙