Determining 4-edge-connected components in linear time

Autor:	Nadara, Wojciech, Radecki, Mateusz, Smulewicz, Marcin, Sokołowski, Marek
Rok vydání:	2021
Předmět:	Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2105.01699 Zobrazit plný text záznamu View this record from Arxiv