3 citations · 3 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Improved Linear-Time Algorithm for Computing the -Edge-Connected Components of a Graph
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
We present an improved algorithm for computing the -edge-connected components of an undirected graph in linear time. The new algorithm uses only elementary data structures, and…
cs.DS2021
Computing the -Edge-Connected Components of a Graph in Linear Time
Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas
We present the first linear-time algorithm that computes the -edge-connected components of an undirected graph. Hence, we also obtain the first linear-time algorithm for testing…