3 citations · 3 across the 1 of their papers we have counts for
3 papers
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…
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…
Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems
Loukas Georgiadis, Evangelos Kosinas
A directed graph is twinless strongly connected if it contains a strongly connected spanning subgraph without any pair of antiparallel (or twin) edges. The twinless stron…